Base | Representation |
---|---|
bin | 1001100011110011000011… |
… | …11011110000111000110101 |
3 | 2202102121102110220011010022 |
4 | 10301321201323300320311 |
5 | 10223402421012101232 |
6 | 112413002324534525 |
7 | 4266506153231432 |
oct | 461714173607065 |
9 | 82377373804108 |
10 | 21021213003317 |
11 | 677505679a32a |
12 | 2436075851445 |
13 | b963a4352237 |
14 | 529609b02b89 |
15 | 266c23ac1812 |
hex | 131e61ef0e35 |
21021213003317 has 2 divisors, whose sum is σ = 21021213003318. Its totient is φ = 21021213003316.
The previous prime is 21021213003313. The next prime is 21021213003347. The reversal of 21021213003317 is 71330031212012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13610263045681 + 7410949957636 = 3689209^2 + 2722306^2 .
It is a cyclic number.
It is not a de Polignac number, because 21021213003317 - 22 = 21021213003313 is a prime.
It is a super-2 number, since 2×210212130033172 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21021213003313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10510606501658 + 10510606501659.
It is an arithmetic number, because the mean of its divisors is an integer number (10510606501659).
Almost surely, 221021213003317 is an apocalyptic number.
It is an amenable number.
21021213003317 is a deficient number, since it is larger than the sum of its proper divisors (1).
21021213003317 is an equidigital number, since it uses as much as digits as its factorization.
21021213003317 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 21021213003317 its reverse (71330031212012), we get a palindrome (92351244215329).
The spelling of 21021213003317 in words is "twenty-one trillion, twenty-one billion, two hundred thirteen million, three thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •