130
CXXX
10000010
The number 130 — factors and divisors
Deficient
130 = 2 × 5 × 13. It has 8 divisors, adding up to 252.
Its divisors, itself excluded, add up to less than the number.
Laid out as dots
It fits as 10 × 13. The more divisors, the closer to a square.
- Prime factors
- 2 × 5 × 13
- Divisors
- 1, 2, 5, 10, 13, 26, 65, 130
- Sum of divisors
- 252
- Sum without itself
- 122
- Coprime below it
- 48
- Digit sum
- 4
- Digital root
- 4
- Roman numeral
- CXXX
- Binary
- 10000010
- Octal
- 202
- Hexadecimal
- 82
- Base 36
- 3M
- Bits
- 8 bits
- Collatz steps
- 28 steps · peaks at 196
- Prime before
- 127
- Prime after
- 131
The grid
Ten per row, twenty rows. The filled cells are primes — you can see the multiples of 2 and 5 drop out in columns.
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200
Numbers either side
How to read this
- The prime factors are what the number is made of. The count and sum of divisors both follow from them.
- Add the divisors, take the number away, and you get perfect, abundant or deficient.
- The length of the binary form is the bit count. 255 taking eight digits is what a byte is.
- Collatz: halve it if even, triple it and add one if odd. The count is how many moves reach 1.
Frequently asked questions
Q. Is 130 a prime number?
No. It breaks down into 2 × 5 × 13.
Q. What are the divisors of 130?
1, 2, 5, 10, 13, 26, 65, 130 — 8 divisors in all, adding up to 252.
Q. How is 130 written in binary?
10000010, which is 8 bits. In hexadecimal it is 82.
Q. How many Collatz steps does 130 take?
It reaches 1 in 28, peaking at 196 on the way.