Base | Representation |
---|---|
bin | 110010000001101101111001… |
… | …100111111111111110110101 |
3 | 1001212000201221002221210010001 |
4 | 302001231321213333332311 |
5 | 212314303114012413023 |
6 | 2055535535550231301 |
7 | 64225641614236456 |
oct | 6201557147777665 |
9 | 1055021832853101 |
10 | 220020330201013 |
11 | 64118109531301 |
12 | 208154b74b5531 |
13 | 959ca9c490954 |
14 | 3c4907dd5d12d |
15 | 1a68378b686ad |
hex | c81b799fffb5 |
220020330201013 has 16 divisors (see below), whose sum is σ = 223891613313280. Its totient is φ = 216157642243200.
The previous prime is 220020330200989. The next prime is 220020330201017. The reversal of 220020330201013 is 310102033020022.
It is a cyclic number.
It is not a de Polignac number, because 220020330201013 - 29 = 220020330200501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220020330201017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 403257448 + ... + 403802686.
It is an arithmetic number, because the mean of its divisors is an integer number (13993225832080).
Almost surely, 2220020330201013 is an apocalyptic number.
It is an amenable number.
220020330201013 is a deficient number, since it is larger than the sum of its proper divisors (3871283112267).
220020330201013 is an equidigital number, since it uses as much as digits as its factorization.
220020330201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 553108.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 220020330201013 its reverse (310102033020022), we get a palindrome (530122363221035).
The spelling of 220020330201013 in words is "two hundred twenty trillion, twenty billion, three hundred thirty million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •