Base | Representation |
---|---|
bin | 101111001000010100… |
… | …1010111100000110001 |
3 | 100200020120101002012110 |
4 | 1132100221113200301 |
5 | 3124240004323441 |
6 | 114255023115533 |
7 | 10212050254113 |
oct | 1362051274061 |
9 | 320216332173 |
10 | 101211011121 |
11 | 39a17a82740 |
12 | 17747442ba9 |
13 | 970c68aa7c |
14 | 4c81c193b3 |
15 | 29756ecb16 |
hex | 1790a57831 |
101211011121 has 16 divisors (see below), whose sum is σ = 151194829248. Its totient is φ = 59682168000.
The previous prime is 101211011087. The next prime is 101211011123. The reversal of 101211011121 is 121110112101.
It is not a de Polignac number, because 101211011121 - 221 = 101208913969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101211011097 and 101211011106.
It is not an unprimeable number, because it can be changed into a prime (101211011123) 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 15 ways as a sum of consecutive naturals, for example, 41444730 + ... + 41447171.
It is an arithmetic number, because the mean of its divisors is an integer number (9449676828).
Almost surely, 2101211011121 is an apocalyptic number.
101211011121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101211011121 is a deficient number, since it is larger than the sum of its proper divisors (49983818127).
101211011121 is a wasteful number, since it uses less digits than its factorization.
101211011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82891952.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101211011121 its reverse (121110112101), we get a palindrome (222321123222).
The spelling of 101211011121 in words is "one hundred one billion, two hundred eleven million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •