Base | Representation |
---|---|
bin | 10110110010001111111100… |
… | …001001000000010100011100 |
3 | 111010210222211000111022010120 |
4 | 112302033330021000110130 |
5 | 101113320302210431022 |
6 | 553043520124234540 |
7 | 30051640666323621 |
oct | 2662177411002434 |
9 | 433728730438116 |
10 | 100210112202012 |
11 | 29a2596295841a |
12 | b2a548399ba50 |
13 | 43bba08478cb7 |
14 | 1aa62a3d02348 |
15 | b8ba658b6d5c |
hex | 5b23fc24051c |
100210112202012 has 48 divisors (see below), whose sum is σ = 233864898906912. Its totient is φ = 33397470812160.
The previous prime is 100210112201971. The next prime is 100210112202037. The reversal of 100210112202012 is 210202211012001.
It is a junction number, because it is equal to n+sod(n) for n = 100210112201982 and 100210112202000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1940639058 + ... + 1940690694.
It is an arithmetic number, because the mean of its divisors is an integer number (4872185393894).
Almost surely, 2100210112202012 is an apocalyptic number.
100210112202012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100210112202012 is an abundant number, since it is smaller than the sum of its proper divisors (133654786704900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100210112202012 is a wasteful number, since it uses less digits than its factorization.
100210112202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77078 (or 77076 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100210112202012 its reverse (210202211012001), we get a palindrome (310412323214013).
The spelling of 100210112202012 in words is "one hundred trillion, two hundred ten billion, one hundred twelve million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •