Base | Representation |
---|---|
bin | 1100110011100111001… |
… | …1111101001001101101 |
3 | 210000220002202021202111 |
4 | 3030321303331021231 |
5 | 12101041343100404 |
6 | 245023411324021 |
7 | 21616063540030 |
oct | 3147163751155 |
9 | 700802667674 |
10 | 220013253229 |
11 | 85341822600 |
12 | 36781bb0611 |
13 | 17993687353 |
14 | a912057017 |
15 | 5aca45c104 |
hex | 3339cfd26d |
220013253229 has 24 divisors (see below), whose sum is σ = 276553347840. Its totient is φ = 171331548960.
The previous prime is 220013253211. The next prime is 220013253247. The reversal of 220013253229 is 922352310022.
It is an interprime number because it is at equal distance from previous prime (220013253211) and next prime (220013253247).
It is not a de Polignac number, because 220013253229 - 225 = 219979698797 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220013253229.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220013223229) 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 23 ways as a sum of consecutive naturals, for example, 1285692 + ... + 1446730.
It is an arithmetic number, because the mean of its divisors is an integer number (11523056160).
Almost surely, 2220013253229 is an apocalyptic number.
It is an amenable number.
220013253229 is a deficient number, since it is larger than the sum of its proper divisors (56540094611).
220013253229 is a wasteful number, since it uses less digits than its factorization.
220013253229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162681 (or 162670 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 31.
The spelling of 220013253229 in words is "two hundred twenty billion, thirteen million, two hundred fifty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •