Base | Representation |
---|---|
bin | 1010000000010011010101… |
… | …11100001000111000110101 |
3 | 2212220020102210121220202022 |
4 | 11000021222330020320311 |
5 | 10340424230324440203 |
6 | 114442535503522525 |
7 | 4430330534622242 |
oct | 500115274107065 |
9 | 85806383556668 |
10 | 22000616640053 |
11 | 70124555a16a7 |
12 | 2573a49bb9445 |
13 | c3785951b97c |
14 | 560b9a9865c9 |
15 | 28244706ba38 |
hex | 14026af08e35 |
22000616640053 has 2 divisors, whose sum is σ = 22000616640054. Its totient is φ = 22000616640052.
The previous prime is 22000616640047. The next prime is 22000616640097. The reversal of 22000616640053 is 35004661600022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21354814750129 + 645801889924 = 4621127^2 + 803618^2 .
It is a cyclic number.
It is not a de Polignac number, because 22000616640053 - 212 = 22000616635957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22000616639995 and 22000616640022.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22000616690053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11000308320026 + 11000308320027.
It is an arithmetic number, because the mean of its divisors is an integer number (11000308320027).
Almost surely, 222000616640053 is an apocalyptic number.
It is an amenable number.
22000616640053 is a deficient number, since it is larger than the sum of its proper divisors (1).
22000616640053 is an equidigital number, since it uses as much as digits as its factorization.
22000616640053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 22000616640053 in words is "twenty-two trillion, six hundred sixteen million, six hundred forty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •