Base | Representation |
---|---|
bin | 1111100010000… |
… | …11111101110000 |
3 | 100002012000110220 |
4 | 13301003331300 |
5 | 231324124213 |
6 | 20532453040 |
7 | 3141355440 |
oct | 761037560 |
9 | 302160426 |
10 | 130301808 |
11 | 6760874a |
12 | 3777a180 |
13 | 20cc2c80 |
14 | 1343c120 |
15 | b68ce23 |
hex | 7c43f70 |
130301808 has 160 divisors (see below), whose sum is σ = 432638976. Its totient is φ = 32845824.
The previous prime is 130301807. The next prime is 130301833. The reversal of 130301808 is 808103031.
It is a super-2 number, since 2×1303018082 = 33957122336137728, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130301803) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 99816 + ... + 101112.
Almost surely, 2130301808 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130301808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (216319488).
130301808 is an abundant number, since it is smaller than the sum of its proper divisors (302337168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130301808 is a wasteful number, since it uses less digits than its factorization.
130301808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1351 (or 1345 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
The square root of 130301808 is about 11414.9817345452. The cubic root of 130301808 is about 506.9714240709.
Adding to 130301808 its reverse (808103031), we get a palindrome (938404839).
The spelling of 130301808 in words is "one hundred thirty million, three hundred one thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •