Base | Representation |
---|---|
bin | 110010000001101101111001… |
… | …001100100001111010100101 |
3 | 1001212000201220121101221010212 |
4 | 302001231321030201322211 |
5 | 212314303110141444343 |
6 | 2055535535132025205 |
7 | 64225641466105256 |
oct | 6201557114417245 |
9 | 1055021817357125 |
10 | 220020322999973 |
11 | 64118105463031 |
12 | 208154b5002205 |
13 | 959ca9ab3c092 |
14 | 3c4907d006b2d |
15 | 1a683781e4c18 |
hex | c81b79321ea5 |
220020322999973 has 2 divisors, whose sum is σ = 220020322999974. Its totient is φ = 220020322999972.
The previous prime is 220020322999927. The next prime is 220020322999979. The reversal of 220020322999973 is 379999223020022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 215782497274369 + 4237825725604 = 14689537^2 + 2058598^2 .
It is a cyclic number.
It is not a de Polignac number, because 220020322999973 - 224 = 220020306222757 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220020322999979) 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 as a sum of consecutive naturals, namely, 110010161499986 + 110010161499987.
It is an arithmetic number, because the mean of its divisors is an integer number (110010161499987).
Almost surely, 2220020322999973 is an apocalyptic number.
It is an amenable number.
220020322999973 is a deficient number, since it is larger than the sum of its proper divisors (1).
220020322999973 is an equidigital number, since it uses as much as digits as its factorization.
220020322999973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13226976, while the sum is 59.
The spelling of 220020322999973 in words is "two hundred twenty trillion, twenty billion, three hundred twenty-two million, nine hundred ninety-nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •