Base | Representation |
---|---|
bin | 10010110100001010… |
… | …00110001101110011 |
3 | 222001222020011011002 |
4 | 21122011012031303 |
5 | 131141403021321 |
6 | 4350200112215 |
7 | 505213645415 |
oct | 113205061563 |
9 | 28058204132 |
10 | 10101220211 |
11 | 431396a285 |
12 | 1b5aa6566b |
13 | c4c96a4a4 |
14 | 6bb7909b5 |
15 | 3e1c0420b |
hex | 25a146373 |
10101220211 has 8 divisors (see below), whose sum is σ = 10709361600. Its totient is φ = 9500728680.
The previous prime is 10101220163. The next prime is 10101220219. The reversal of 10101220211 is 11202210101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10101220211 - 26 = 10101220147 is a prime.
It is a super-2 number, since 2×101012202112 (a number of 21 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 = 10101220192 and 10101220201.
It is not an unprimeable number, because it can be changed into a prime (10101220219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1909745 + ... + 1915026.
It is an arithmetic number, because the mean of its divisors is an integer number (1338670200).
Almost surely, 210101220211 is an apocalyptic number.
10101220211 is a deficient number, since it is larger than the sum of its proper divisors (608141389).
10101220211 is a wasteful number, since it uses less digits than its factorization.
10101220211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3824929.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10101220211 its reverse (11202210101), we get a palindrome (21303430312).
It can be divided in two parts, 1010 and 1220211, that added together give a palindrome (1221221).
The spelling of 10101220211 in words is "ten billion, one hundred one million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •