Base | Representation |
---|---|
bin | 101111001000010101… |
… | …0001010100010011000 |
3 | 100200020120202200220011 |
4 | 1132100222022202120 |
5 | 3124240033020440 |
6 | 114255031411304 |
7 | 10212052114333 |
oct | 1362052124230 |
9 | 320216680804 |
10 | 101211220120 |
11 | 39a1810576a |
12 | 17747523b34 |
13 | 970c731c3a |
14 | 4c81c7161a |
15 | 297573e9ea |
hex | 1790a8a898 |
101211220120 has 16 divisors (see below), whose sum is σ = 227725245360. Its totient is φ = 40484488032.
The previous prime is 101211220087. The next prime is 101211220133. The reversal of 101211220120 is 21022112101.
It is a super-2 number, since 2×1012112201202 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101211220120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1265140212 + ... + 1265140291.
It is an arithmetic number, because the mean of its divisors is an integer number (14232827835).
Almost surely, 2101211220120 is an apocalyptic number.
101211220120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101211220120 is an abundant number, since it is smaller than the sum of its proper divisors (126514025240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101211220120 is a wasteful number, since it uses less digits than its factorization.
101211220120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2530280514 (or 2530280510 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101211220120 its reverse (21022112101), we get a palindrome (122233332221).
The spelling of 101211220120 in words is "one hundred one billion, two hundred eleven million, two hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •