Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …01100110001010100000101 |
3 | 2212222002222121012020101212 |
4 | 11000123322030301110011 |
5 | 10341234332200323023 |
6 | 114455535031301205 |
7 | 4431623040545231 |
oct | 500337214612405 |
9 | 85862877166355 |
10 | 22020200011013 |
11 | 701a7949280a6 |
12 | 25777b451a805 |
13 | c3965a7b2039 |
14 | 561ad77b95c1 |
15 | 282be143be78 |
hex | 1406fa331505 |
22020200011013 has 2 divisors, whose sum is σ = 22020200011014. Its totient is φ = 22020200011012.
The previous prime is 22020200010961. The next prime is 22020200011021. The reversal of 22020200011013 is 31011000202022.
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., 21650343858049 + 369856152964 = 4652993^2 + 608158^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22020200011013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22020200011093) 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, 11010100005506 + 11010100005507.
It is an arithmetic number, because the mean of its divisors is an integer number (11010100005507).
Almost surely, 222020200011013 is an apocalyptic number.
It is an amenable number.
22020200011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
22020200011013 is an equidigital number, since it uses as much as digits as its factorization.
22020200011013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 22020200011013 its reverse (31011000202022), we get a palindrome (53031200213035).
The spelling of 22020200011013 in words is "twenty-two trillion, twenty billion, two hundred million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •