Base | Representation |
---|---|
bin | 1001100100000101010100… |
… | …00100100110010010010101 |
3 | 2202110112201110201101220122 |
4 | 10302002222010212102111 |
5 | 10224033003340311313 |
6 | 112421303013241325 |
7 | 4300304053522334 |
oct | 462025204462225 |
9 | 82415643641818 |
10 | 21031013213333 |
11 | 6779225755152 |
12 | 2437b4b933245 |
13 | b972a6829b86 |
14 | 529c994d9d1b |
15 | 2670e9167708 |
hex | 1320aa126495 |
21031013213333 has 2 divisors, whose sum is σ = 21031013213334. Its totient is φ = 21031013213332.
The previous prime is 21031013213323. The next prime is 21031013213381. The reversal of 21031013213333 is 33331231013012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19539874274449 + 1491138938884 = 4420393^2 + 1221122^2 .
It is a cyclic number.
It is not a de Polignac number, because 21031013213333 - 222 = 21031009019029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21031013213323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10515506606666 + 10515506606667.
It is an arithmetic number, because the mean of its divisors is an integer number (10515506606667).
Almost surely, 221031013213333 is an apocalyptic number.
It is an amenable number.
21031013213333 is a deficient number, since it is larger than the sum of its proper divisors (1).
21031013213333 is an equidigital number, since it uses as much as digits as its factorization.
21031013213333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 21031013213333 its reverse (33331231013012), we get a palindrome (54362244226345).
The spelling of 21031013213333 in words is "twenty-one trillion, thirty-one billion, thirteen million, two hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •