Base | Representation |
---|---|
bin | 1001100011110001011000… |
… | …01011101100100000011101 |
3 | 2202102112002122000022021022 |
4 | 10301320230023230200131 |
5 | 10223344044132210023 |
6 | 112412333032213525 |
7 | 4266444623143433 |
oct | 461705413544035 |
9 | 82375078008238 |
10 | 21020311210013 |
11 | 6774733752705 |
12 | 2435a6383a2a5 |
13 | b9628c57b52b |
14 | 52956203ad53 |
15 | 266bbe83d7c8 |
hex | 131e2c2ec81d |
21020311210013 has 2 divisors, whose sum is σ = 21020311210014. Its totient is φ = 21020311210012.
The previous prime is 21020311210009. The next prime is 21020311210037. The reversal of 21020311210013 is 31001211302012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16856173063129 + 4164138146884 = 4105627^2 + 2040622^2 .
It is a cyclic number.
It is not a de Polignac number, because 21020311210013 - 22 = 21020311210009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21020311209973 and 21020311210000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21020311210513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10510155605006 + 10510155605007.
It is an arithmetic number, because the mean of its divisors is an integer number (10510155605007).
Almost surely, 221020311210013 is an apocalyptic number.
It is an amenable number.
21020311210013 is a deficient number, since it is larger than the sum of its proper divisors (1).
21020311210013 is an equidigital number, since it uses as much as digits as its factorization.
21020311210013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 21020311210013 its reverse (31001211302012), we get a palindrome (52021522512025).
The spelling of 21020311210013 in words is "twenty-one trillion, twenty billion, three hundred eleven million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •