Base | Representation |
---|---|
bin | 101111000010101000… |
… | …1001011110001100010 |
3 | 100122202021011220211210 |
4 | 1132011101023301202 |
5 | 3123342122402320 |
6 | 114224043450550 |
7 | 10204241604510 |
oct | 1360521136142 |
9 | 318667156753 |
10 | 101020122210 |
11 | 3992a253007 |
12 | 176b3526a56 |
13 | 96abc73857 |
14 | 4c647294b0 |
15 | 2963a930e0 |
hex | 178544bc62 |
101020122210 has 256 divisors, whose sum is σ = 304122470400. Its totient is φ = 20939649024.
The previous prime is 101020122187. The next prime is 101020122253. The reversal of 101020122210 is 12221020101.
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 86861089 + ... + 86862251.
It is an arithmetic number, because the mean of its divisors is an integer number (1187978400).
Almost surely, 2101020122210 is an apocalyptic number.
101020122210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101020122210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152061235200).
101020122210 is an abundant number, since it is smaller than the sum of its proper divisors (203102348190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020122210 is a wasteful number, since it uses less digits than its factorization.
101020122210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2065.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101020122210 its reverse (12221020101), we get a palindrome (113241142311).
The spelling of 101020122210 in words is "one hundred one billion, twenty million, one hundred twenty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •