Base | Representation |
---|---|
bin | 101111001000000000… |
… | …0001100111111011001 |
3 | 100200012211001211201210 |
4 | 1132100000030333121 |
5 | 3124224224020441 |
6 | 114253555533333 |
7 | 10211556451350 |
oct | 1362000147731 |
9 | 320184054653 |
10 | 101200220121 |
11 | 39a11982260 |
12 | 177438ba249 |
13 | 970a380170 |
14 | 4c8060a997 |
15 | 29747ba616 |
hex | 179000cfd9 |
101200220121 has 32 divisors (see below), whose sum is σ = 181169630208. Its totient is φ = 48527576640.
The previous prime is 101200220117. The next prime is 101200220137. The reversal of 101200220121 is 121022002101.
It is not a de Polignac number, because 101200220121 - 22 = 101200220117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101200220097 and 101200220106.
It is not an unprimeable number, because it can be changed into a prime (101200220111) 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, 16846851 + ... + 16852856.
It is an arithmetic number, because the mean of its divisors is an integer number (5661550944).
Almost surely, 2101200220121 is an apocalyptic number.
101200220121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101200220121 is a deficient number, since it is larger than the sum of its proper divisors (79969410087).
101200220121 is a wasteful number, since it uses less digits than its factorization.
101200220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33699741.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101200220121 its reverse (121022002101), we get a palindrome (222222222222).
The spelling of 101200220121 in words is "one hundred one billion, two hundred million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •