Base | Representation |
---|---|
bin | 1010000110000110101111… |
… | …10101000111001000011101 |
3 | 2220121022010000012012202112 |
4 | 11003003113311013020131 |
5 | 10402211111033310023 |
6 | 115114313354403405 |
7 | 4450616664404405 |
oct | 503032765071035 |
9 | 86538100165675 |
10 | 22200012010013 |
11 | 7089a77032352 |
12 | 25a6617130565 |
13 | c505b54b0996 |
14 | 56a6b4637805 |
15 | 2877173ab478 |
hex | 1430d7d4721d |
22200012010013 has 2 divisors, whose sum is σ = 22200012010014. Its totient is φ = 22200012010012.
The previous prime is 22200012009983. The next prime is 22200012010019. The reversal of 22200012010013 is 31001021000222.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20317402995289 + 1882609014724 = 4507483^2 + 1372082^2 .
It is a cyclic number.
It is not a de Polignac number, because 22200012010013 - 218 = 22200011747869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22200012010013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22200012010019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11100006005006 + 11100006005007.
It is an arithmetic number, because the mean of its divisors is an integer number (11100006005007).
Almost surely, 222200012010013 is an apocalyptic number.
It is an amenable number.
22200012010013 is a deficient number, since it is larger than the sum of its proper divisors (1).
22200012010013 is an equidigital number, since it uses as much as digits as its factorization.
22200012010013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 22200012010013 its reverse (31001021000222), we get a palindrome (53201033010235).
The spelling of 22200012010013 in words is "twenty-two trillion, two hundred billion, twelve million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •