Base | Representation |
---|---|
bin | 110010000001011111110110… |
… | …111110100101111011101001 |
3 | 1001211222022000101022021002002 |
4 | 302001133312332211323221 |
5 | 212314031224333001231 |
6 | 2055525003530220345 |
7 | 64224566162504246 |
oct | 6201376676457351 |
9 | 1054868011267062 |
10 | 220005253406441 |
11 | 641117820283a8 |
12 | 208125aa2846b5 |
13 | 959b538a67529 |
14 | 3c4844d8685cd |
15 | 1a67c952350cb |
hex | c817f6fa5ee9 |
220005253406441 has 16 divisors (see below), whose sum is σ = 225815423980608. Its totient is φ = 214216559635200.
The previous prime is 220005253406327. The next prime is 220005253406453. The reversal of 220005253406441 is 144604352500022.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220005253406441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220005253406395 and 220005253406404.
It is not an unprimeable number, because it can be changed into a prime (220005253406461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52167530 + ... + 56226876.
It is an arithmetic number, because the mean of its divisors is an integer number (14113463998788).
Almost surely, 2220005253406441 is an apocalyptic number.
It is an amenable number.
220005253406441 is a deficient number, since it is larger than the sum of its proper divisors (5810170574167).
220005253406441 is a wasteful number, since it uses less digits than its factorization.
220005253406441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4061992.
The product of its (nonzero) digits is 230400, while the sum is 38.
The spelling of 220005253406441 in words is "two hundred twenty trillion, five billion, two hundred fifty-three million, four hundred six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •