Base | Representation |
---|---|
bin | 110010000010111010000101… |
… | …111111010000101110010001 |
3 | 1001212022120002201021222201112 |
4 | 302002322011333100232101 |
5 | 212322123141323112423 |
6 | 2100041310025143105 |
7 | 64234566156135035 |
oct | 6202720577205621 |
9 | 1055276081258645 |
10 | 220102142004113 |
11 | 64149881123916 |
12 | 2082932a02aa95 |
13 | 95a7709a88cb5 |
14 | 3c4d0015a41c5 |
15 | 1a6a566222a78 |
hex | c82e85fd0b91 |
220102142004113 has 16 divisors (see below), whose sum is σ = 223969239491712. Its totient is φ = 216243507168000.
The previous prime is 220102142004109. The next prime is 220102142004181. The reversal of 220102142004113 is 311400241201022.
It is a cyclic number.
It is not a de Polignac number, because 220102142004113 - 22 = 220102142004109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (220102142904113) 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, 236185868 + ... + 237115938.
It is an arithmetic number, because the mean of its divisors is an integer number (13998077468232).
Almost surely, 2220102142004113 is an apocalyptic number.
It is an amenable number.
220102142004113 is a deficient number, since it is larger than the sum of its proper divisors (3867097487599).
220102142004113 is a wasteful number, since it uses less digits than its factorization.
220102142004113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 934616.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 220102142004113 its reverse (311400241201022), we get a palindrome (531502383205135).
The spelling of 220102142004113 in words is "two hundred twenty trillion, one hundred two billion, one hundred forty-two million, four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •