Base | Representation |
---|---|
bin | 1001101001010011010010… |
… | …01100001100110000101001 |
3 | 2210002200112012111012211122 |
4 | 10310221221030030300221 |
5 | 10240002210202011241 |
6 | 113035514452505025 |
7 | 4316252223315536 |
oct | 464515114146051 |
9 | 83080465435748 |
10 | 21210313313321 |
11 | 6838274a06070 |
12 | 246684b01b175 |
13 | bab17c4686b2 |
14 | 534828385d8d |
15 | 26bae01bd04b |
hex | 134a6930cc29 |
21210313313321 has 8 divisors (see below), whose sum is σ = 23530701981600. Its totient is φ = 18955287706240.
The previous prime is 21210313313309. The next prime is 21210313313381. The reversal of 21210313313321 is 12331331301212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21210313313321 - 214 = 21210313296937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21210313313381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16340764616 + ... + 16340765913.
It is an arithmetic number, because the mean of its divisors is an integer number (2941337747700).
Almost surely, 221210313313321 is an apocalyptic number.
It is an amenable number.
21210313313321 is a deficient number, since it is larger than the sum of its proper divisors (2320388668279).
21210313313321 is a wasteful number, since it uses less digits than its factorization.
21210313313321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32681530599.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 21210313313321 its reverse (12331331301212), we get a palindrome (33541644614533).
The spelling of 21210313313321 in words is "twenty-one trillion, two hundred ten billion, three hundred thirteen million, three hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •