Base | Representation |
---|---|
bin | 101110100100010010… |
… | …1110100100110001001 |
3 | 100120010022122011020210 |
4 | 1131020211310212021 |
5 | 3114301020401441 |
6 | 113535040311333 |
7 | 10140101004306 |
oct | 1351045644611 |
9 | 316108564223 |
10 | 100002122121 |
11 | 39457655520 |
12 | 1746a612549 |
13 | 95790a3635 |
14 | 4ba94540ad |
15 | 2904508616 |
hex | 1748974989 |
100002122121 has 32 divisors (see below), whose sum is σ = 150314250240. Its totient is φ = 58611672000.
The previous prime is 100002122021. The next prime is 100002122159. The reversal of 100002122121 is 121221200001.
It is a de Polignac number, because none of the positive numbers 2k-100002122121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100002122097 and 100002122106.
It is not an unprimeable number, because it can be changed into a prime (100002122021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 205561 + ... + 492198.
It is an arithmetic number, because the mean of its divisors is an integer number (4697320320).
Almost surely, 2100002122121 is an apocalyptic number.
100002122121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100002122121 is a deficient number, since it is larger than the sum of its proper divisors (50312128119).
100002122121 is a wasteful number, since it uses less digits than its factorization.
100002122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697917.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100002122121 its reverse (121221200001), we get a palindrome (221223322122).
The spelling of 100002122121 in words is "one hundred billion, two million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •