Base | Representation |
---|---|
bin | 10110110000111100111101… |
… | …110101101100001110011100 |
3 | 111010111110212001000201002220 |
4 | 112300330331311230032130 |
5 | 101110340322122401022 |
6 | 552534543415545340 |
7 | 30042335133203301 |
oct | 2660747565541634 |
9 | 433443761021086 |
10 | 100121020122012 |
11 | 299a10a478903a |
12 | b29015b08b250 |
13 | 43b34aa7942b6 |
14 | 1aa1c518230a8 |
15 | b8959e0cd85c |
hex | 5b0f3dd6c39c |
100121020122012 has 24 divisors (see below), whose sum is σ = 233615916573312. Its totient is φ = 33373644380400.
The previous prime is 100121020121987. The next prime is 100121020122029. The reversal of 100121020122012 is 210221020121001.
It is a junction number, because it is equal to n+sod(n) for n = 100121020121982 and 100121020122000.
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, 14316687 + ... + 20129817.
It is an arithmetic number, because the mean of its divisors is an integer number (9733996523888).
Almost surely, 2100121020122012 is an apocalyptic number.
100121020122012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100121020122012 is an abundant number, since it is smaller than the sum of its proper divisors (133494896451300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100121020122012 is a wasteful number, since it uses less digits than its factorization.
100121020122012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7248409 (or 7248407 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100121020122012 its reverse (210221020121001), we get a palindrome (310342040243013).
The spelling of 100121020122012 in words is "one hundred trillion, one hundred twenty-one billion, twenty million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •