Base | Representation |
---|---|
bin | 10110110000101011011100… |
… | …000100101010010110001010 |
3 | 111010102200021102122222001210 |
4 | 112300223130010222112022 |
5 | 101110033301200310442 |
6 | 552522152115353550 |
7 | 30041100555661362 |
oct | 2660533404522612 |
9 | 433380242588053 |
10 | 100102200010122 |
11 | 29994117279462 |
12 | b2885882b28b6 |
13 | 43b179b68b80b |
14 | 1aa0d881139a2 |
15 | b88d4bc2919c |
hex | 5b0adc12a58a |
100102200010122 has 32 divisors (see below), whose sum is σ = 210741982470720. Its totient is φ = 31611144741120.
The previous prime is 100102200010093. The next prime is 100102200010129. The reversal of 100102200010122 is 221010002201001.
100102200010122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 100102200010098 and 100102200010107.
It is not an unprimeable number, because it can be changed into a prime (100102200010129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63585972 + ... + 65141232.
It is an arithmetic number, because the mean of its divisors is an integer number (6585686952210).
Almost surely, 2100102200010122 is an apocalyptic number.
100102200010122 is an abundant number, since it is smaller than the sum of its proper divisors (110639782460598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100102200010122 is a wasteful number, since it uses less digits than its factorization.
100102200010122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2119878.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100102200010122 its reverse (221010002201001), we get a palindrome (321112202211123).
The spelling of 100102200010122 in words is "one hundred trillion, one hundred two billion, two hundred million, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •