Base | Representation |
---|---|
bin | 1001101100100010000010… |
… | …01111010110101001100001 |
3 | 2210111022000220110221221021 |
4 | 10312101001033112221201 |
5 | 10243312021410420223 |
6 | 113202513044125441 |
7 | 4330261664306065 |
oct | 466210117265141 |
9 | 83438026427837 |
10 | 21321312201313 |
11 | 688035498a543 |
12 | 2484268396881 |
13 | bb878b8a3587 |
14 | 539d580a7aa5 |
15 | 26e939d2765d |
hex | 1364413d6a61 |
21321312201313 has 16 divisors (see below), whose sum is σ = 21623269885200. Its totient is φ = 21019624574976.
The previous prime is 21321312201289. The next prime is 21321312201377. The reversal of 21321312201313 is 31310221312312.
It can be written as a sum of positive squares in 8 ways, for example, as 13370226267024 + 7951085934289 = 3656532^2 + 2819767^2 .
It is a cyclic number.
It is not a de Polignac number, because 21321312201313 - 29 = 21321312200801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21321312201113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2727552981 + ... + 2727560797.
It is an arithmetic number, because the mean of its divisors is an integer number (1351454367825).
Almost surely, 221321312201313 is an apocalyptic number.
It is an amenable number.
21321312201313 is a deficient number, since it is larger than the sum of its proper divisors (301957683887).
21321312201313 is an equidigital number, since it uses as much as digits as its factorization.
21321312201313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20196.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 21321312201313 its reverse (31310221312312), we get a palindrome (52631533513625).
The spelling of 21321312201313 in words is "twenty-one trillion, three hundred twenty-one billion, three hundred twelve million, two hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •