Base | Representation |
---|---|
bin | 11101000111111000000… |
… | …011010110100011010101 |
3 | 21002022202112022222211002 |
4 | 131013320003112203111 |
5 | 230242201240433023 |
6 | 4131221103353045 |
7 | 264406416253325 |
oct | 35077003264325 |
9 | 7068675288732 |
10 | 2001321421013 |
11 | 701834849a72 |
12 | 283a525b2785 |
13 | 11695425c4b5 |
14 | 6cc16189285 |
15 | 370d3eeeb28 |
hex | 1d1f80d68d5 |
2001321421013 has 2 divisors, whose sum is σ = 2001321421014. Its totient is φ = 2001321421012.
The previous prime is 2001321420997. The next prime is 2001321421081. The reversal of 2001321421013 is 3101241231002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1627953983569 + 373367437444 = 1275913^2 + 611038^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001321421013 - 24 = 2001321420997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001321420013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000660710506 + 1000660710507.
It is an arithmetic number, because the mean of its divisors is an integer number (1000660710507).
Almost surely, 22001321421013 is an apocalyptic number.
It is an amenable number.
2001321421013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001321421013 is an equidigital number, since it uses as much as digits as its factorization.
2001321421013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2001321421013 its reverse (3101241231002), we get a palindrome (5102562652015).
The spelling of 2001321421013 in words is "two trillion, one billion, three hundred twenty-one million, four hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •