Base | Representation |
---|---|
bin | 100000010100011111000… |
… | …111000000000100010101 |
3 | 21212022211201000020111021 |
4 | 200110133013000010111 |
5 | 242342122111133023 |
6 | 4420153355041141 |
7 | 316314642454123 |
oct | 40243707000425 |
9 | 7768751006437 |
10 | 2221020021013 |
11 | 786a24999982 |
12 | 2ba5471401b1 |
13 | 1315976881b1 |
14 | 796d84d6913 |
15 | 3cb91a0635d |
hex | 2051f1c0115 |
2221020021013 has 2 divisors, whose sum is σ = 2221020021014. Its totient is φ = 2221020021012.
The previous prime is 2221020020981. The next prime is 2221020021029. The reversal of 2221020021013 is 3101200201222.
It is a happy number.
It is an a-pointer prime, because the next prime (2221020021029) can be obtained adding 2221020021013 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1292045969124 + 928974051889 = 1136682^2 + 963833^2 .
It is a cyclic number.
It is not a de Polignac number, because 2221020021013 - 25 = 2221020020981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2221020025013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110510010506 + 1110510010507.
It is an arithmetic number, because the mean of its divisors is an integer number (1110510010507).
Almost surely, 22221020021013 is an apocalyptic number.
It is an amenable number.
2221020021013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2221020021013 is an equidigital number, since it uses as much as digits as its factorization.
2221020021013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2221020021013 its reverse (3101200201222), we get a palindrome (5322220222235).
The spelling of 2221020021013 in words is "two trillion, two hundred twenty-one billion, twenty million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •