Base | Representation |
---|---|
bin | 101111001000010101… |
… | …0001010100010011001 |
3 | 100200020120202200220012 |
4 | 1132100222022202121 |
5 | 3124240033020441 |
6 | 114255031411305 |
7 | 10212052114334 |
oct | 1362052124231 |
9 | 320216680805 |
10 | 101211220121 |
11 | 39a18105770 |
12 | 17747523b35 |
13 | 970c731c3b |
14 | 4c81c7161b |
15 | 297573e9eb |
hex | 1790a8a899 |
101211220121 has 16 divisors (see below), whose sum is σ = 111359512320. Its totient is φ = 91223383680.
The previous prime is 101211220087. The next prime is 101211220133. The reversal of 101211220121 is 121022112101.
It is not a de Polignac number, because 101211220121 - 26 = 101211220057 is a prime.
It is a super-2 number, since 2×1012112201212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101211220096 and 101211220105.
It is not an unprimeable number, because it can be changed into a prime (101211220921) 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, 725120 + ... + 853358.
It is an arithmetic number, because the mean of its divisors is an integer number (6959969520).
Almost surely, 2101211220121 is an apocalyptic number.
101211220121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101211220121 is a deficient number, since it is larger than the sum of its proper divisors (10148292199).
101211220121 is a wasteful number, since it uses less digits than its factorization.
101211220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128864.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101211220121 its reverse (121022112101), we get a palindrome (222233332222).
The spelling of 101211220121 in words is "one hundred one billion, two hundred eleven million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •