Base | Representation |
---|---|
bin | 110010000010111001011011… |
… | …001101011101000100100101 |
3 | 1001212022111020200211001211110 |
4 | 302002321123031131010211 |
5 | 212322120204110220141 |
6 | 2100041110510255233 |
7 | 64234542322605102 |
oct | 6202713315350445 |
9 | 1055274220731743 |
10 | 220101424304421 |
11 | 64149542a95480 |
12 | 208291697b7519 |
13 | 95a762419051a |
14 | 3c4cd7413daa9 |
15 | 1a6a523205e16 |
hex | c82e5b35d125 |
220101424304421 has 16 divisors (see below), whose sum is σ = 321545550404160. Its totient is φ = 132812292549120.
The previous prime is 220101424304413. The next prime is 220101424304491. The reversal of 220101424304421 is 124403424101022.
It is not a de Polignac number, because 220101424304421 - 23 = 220101424304413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220101424304401) 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, 14562743820 + ... + 14562758933.
It is an arithmetic number, because the mean of its divisors is an integer number (20096596900260).
Almost surely, 2220101424304421 is an apocalyptic number.
It is an amenable number.
220101424304421 is a deficient number, since it is larger than the sum of its proper divisors (101444126099739).
220101424304421 is a wasteful number, since it uses less digits than its factorization.
220101424304421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29125502996.
The product of its (nonzero) digits is 12288, while the sum is 30.
Adding to 220101424304421 its reverse (124403424101022), we get a palindrome (344504848405443).
The spelling of 220101424304421 in words is "two hundred twenty trillion, one hundred one billion, four hundred twenty-four million, three hundred four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •