Base | Representation |
---|---|
bin | 10110101111100000111011… |
… | …110101010001011011011100 |
3 | 111010011000210020200122202020 |
4 | 112233200323311101123130 |
5 | 101102230432231210022 |
6 | 552421322041100140 |
7 | 30032236261621425 |
oct | 2657407365213334 |
9 | 433130706618666 |
10 | 100022202210012 |
11 | 299631a5635175 |
12 | b274b81187650 |
13 | 43a708cb47114 |
14 | 1a9b15978c64c |
15 | b86c18a4235c |
hex | 5af83bd516dc |
100022202210012 has 24 divisors (see below), whose sum is σ = 233388023371776. Its totient is φ = 33340321944048.
The previous prime is 100022202209999. The next prime is 100022202210031. The reversal of 100022202210012 is 210012202220001.
It is a junction number, because it is equal to n+sod(n) for n = 100022202209973 and 100022202210000.
It is a congruent number.
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, 50503708 + ... + 52446819.
It is an arithmetic number, because the mean of its divisors is an integer number (9724500973824).
Almost surely, 2100022202210012 is an apocalyptic number.
100022202210012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100022202210012 is an abundant number, since it is smaller than the sum of its proper divisors (133365821161764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100022202210012 is a wasteful number, since it uses less digits than its factorization.
100022202210012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103031497 (or 103031495 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 100022202210012 its reverse (210012202220001), we get a palindrome (310034404430013).
The spelling of 100022202210012 in words is "one hundred trillion, twenty-two billion, two hundred two million, two hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •