Base | Representation |
---|---|
bin | 101111001000100110… |
… | …0011111110100110011 |
3 | 100200021012200221200212 |
4 | 1132101030133310303 |
5 | 3124244334021321 |
6 | 114255552334335 |
7 | 10212221450555 |
oct | 1362114376463 |
9 | 320235627625 |
10 | 101220220211 |
11 | 39a221a2660 |
12 | 1774a5443ab |
13 | 9711563636 |
14 | 4c831354d5 |
15 | 297641b55b |
hex | 179131fd33 |
101220220211 has 4 divisors (see below), whose sum is σ = 110422058424. Its totient is φ = 92018382000.
The previous prime is 101220220181. The next prime is 101220220223. The reversal of 101220220211 is 112022022101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101220220211 - 26 = 101220220147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101220220411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4600919090 + ... + 4600919111.
It is an arithmetic number, because the mean of its divisors is an integer number (27605514606).
Almost surely, 2101220220211 is an apocalyptic number.
101220220211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101220220211 is a deficient number, since it is larger than the sum of its proper divisors (9201838213).
101220220211 is an equidigital number, since it uses as much as digits as its factorization.
101220220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9201838212.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101220220211 its reverse (112022022101), we get a palindrome (213242242312).
It can be divided in two parts, 10 and 1220220211, that added together give a palindrome (1220220221).
The spelling of 101220220211 in words is "one hundred one billion, two hundred twenty million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •