Base | Representation |
---|---|
bin | 110010000010111000000110… |
… | …111010010110111000110011 |
3 | 1001212022100121010120120122111 |
4 | 302002320012322112320303 |
5 | 212322104310030342321 |
6 | 2100040314305150151 |
7 | 64234462300405150 |
oct | 6202700672267063 |
9 | 1055270533516574 |
10 | 220100010012211 |
11 | 6414898772483a |
12 | 20828a3402b357 |
13 | 95a745a179624 |
14 | 3c4cc7c38b227 |
15 | 1a6a48de8b5e1 |
hex | c82e06e96e33 |
220100010012211 has 16 divisors (see below), whose sum is σ = 266663128333824. Its totient is φ = 177343924996224.
The previous prime is 220100010012067. The next prime is 220100010012229. The reversal of 220100010012211 is 112210010001022.
It is not a de Polignac number, because 220100010012211 - 211 = 220100010010163 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220100010012191 and 220100010012200.
It is not an unprimeable number, because it can be changed into a prime (220100010012811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1123583665 + ... + 1123779538.
It is an arithmetic number, because the mean of its divisors is an integer number (16666445520864).
Almost surely, 2220100010012211 is an apocalyptic number.
220100010012211 is a deficient number, since it is larger than the sum of its proper divisors (46563118321613).
220100010012211 is a wasteful number, since it uses less digits than its factorization.
220100010012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2247364050.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220100010012211 its reverse (112210010001022), we get a palindrome (332310020013233).
The spelling of 220100010012211 in words is "two hundred twenty trillion, one hundred billion, ten million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •