Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …01101100100100101010101 |
3 | 2212222002222121120220110122 |
4 | 11000123322031210211111 |
5 | 10341234332224033023 |
6 | 114455535040001325 |
7 | 4431623042411411 |
oct | 500337215444525 |
9 | 85862877526418 |
10 | 22020200221013 |
11 | 701a794a60955 |
12 | 25777b4600245 |
13 | c3965a8567b7 |
14 | 561ad7831d41 |
15 | 282be147e2c8 |
hex | 1406fa364955 |
22020200221013 has 2 divisors, whose sum is σ = 22020200221014. Its totient is φ = 22020200221012.
The previous prime is 22020200220911. The next prime is 22020200221027. The reversal of 22020200221013 is 31012200202022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16901488544164 + 5118711676849 = 4111142^2 + 2262457^2 .
It is a cyclic number.
It is not a de Polignac number, because 22020200221013 - 228 = 22019931785557 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22020200220982 and 22020200221000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22020200220013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11010100110506 + 11010100110507.
It is an arithmetic number, because the mean of its divisors is an integer number (11010100110507).
Almost surely, 222020200221013 is an apocalyptic number.
It is an amenable number.
22020200221013 is a deficient number, since it is larger than the sum of its proper divisors (1).
22020200221013 is an equidigital number, since it uses as much as digits as its factorization.
22020200221013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 22020200221013 its reverse (31012200202022), we get a palindrome (53032400423035).
The spelling of 22020200221013 in words is "twenty-two trillion, twenty billion, two hundred million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •