Base | Representation |
---|---|
bin | 10110101111100000110110… |
… | …111111111001110111100100 |
3 | 111010011000120121002101211120 |
4 | 112233200312333321313210 |
5 | 101102230301001023022 |
6 | 552421310022533540 |
7 | 30032234255400252 |
oct | 2657406677716744 |
9 | 433130517071746 |
10 | 100022121111012 |
11 | 29963163883301 |
12 | b274b59b972b0 |
13 | 43a70790c0749 |
14 | 1a9b14cabb5d2 |
15 | b86c11872d5c |
hex | 5af836ff9de4 |
100022121111012 has 24 divisors (see below), whose sum is σ = 233426857288800. Its totient is φ = 33334720175616.
The previous prime is 100022121111007. The next prime is 100022121111083. The reversal of 100022121111012 is 210111121220001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 100022121110982 and 100022121111000.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 748288062 + ... + 748421717.
It is an arithmetic number, because the mean of its divisors is an integer number (9726119053700).
Almost surely, 2100022121111012 is an apocalyptic number.
100022121111012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100022121111012 is an abundant number, since it is smaller than the sum of its proper divisors (133404736177788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100022121111012 is a wasteful number, since it uses less digits than its factorization.
100022121111012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1496715355 (or 1496715353 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100022121111012 its reverse (210111121220001), we get a palindrome (310133242331013).
The spelling of 100022121111012 in words is "one hundred trillion, twenty-two billion, one hundred twenty-one million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •