Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1100001001001110000 |
3 | 100200020111110210222210 |
4 | 1132100211201021300 |
5 | 3124234230031112 |
6 | 114254545332120 |
7 | 10212035552136 |
oct | 1362045411160 |
9 | 320214423883 |
10 | 101210002032 |
11 | 39a17453587 |
12 | 17747037040 |
13 | 970c3c6689 |
14 | 4c81a35756 |
15 | 297559db3c |
hex | 1790961270 |
101210002032 has 40 divisors (see below), whose sum is σ = 265040813584. Its totient is φ = 33274520064.
The previous prime is 101210002031. The next prime is 101210002067. The reversal of 101210002032 is 230200012101.
It is a super-2 number, since 2×1012100020322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 101210001999 and 101210002017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101210002031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14438563 + ... + 14445570.
Almost surely, 2101210002032 is an apocalyptic number.
101210002032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101210002032 is an abundant number, since it is smaller than the sum of its proper divisors (163830811552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210002032 is a wasteful number, since it uses less digits than its factorization.
101210002032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28884217 (or 28884211 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 101210002032 its reverse (230200012101), we get a palindrome (331410014133).
The spelling of 101210002032 in words is "one hundred one billion, two hundred ten million, two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •