Base | Representation |
---|---|
bin | 111100001000110… |
… | …000110101010100 |
3 | 2121022110221221200 |
4 | 330020300311110 |
5 | 4031241231012 |
6 | 244040512500 |
7 | 34000523160 |
oct | 7410606524 |
9 | 2538427850 |
10 | 1008930132 |
11 | 478573161 |
12 | 241a7b730 |
13 | 131045aa2 |
14 | 97dd3ca0 |
15 | 5d8973dc |
hex | 3c230d54 |
1008930132 has 72 divisors (see below), whose sum is σ = 2985807552. Its totient is φ = 281232000.
The previous prime is 1008930053. The next prime is 1008930133. The reversal of 1008930132 is 2310398001.
It is a super-2 number, since 2×10089301322 = 2035880022515074848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1008930096 and 1008930105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1008930133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38494 + ... + 59157.
Almost surely, 21008930132 is an apocalyptic number.
1008930132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1008930132 is an abundant number, since it is smaller than the sum of its proper divisors (1976877420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1008930132 is a wasteful number, since it uses less digits than its factorization.
1008930132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97709 (or 97704 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 1008930132 is about 31763.6605573098. The cubic root of 1008930132 is about 1002.9678935604.
The spelling of 1008930132 in words is "one billion, eight million, nine hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •