Base | Representation |
---|---|
bin | 1001100011110001010111… |
… | …01000100101000001101101 |
3 | 2202102112001222200121110012 |
4 | 10301320223220211001231 |
5 | 10223344034303114313 |
6 | 112412332103023005 |
7 | 4266444451662632 |
oct | 461705350450155 |
9 | 82375058617405 |
10 | 21020302004333 |
11 | 6774729535305 |
12 | 2435a6073aa65 |
13 | b9628a6a7398 |
14 | 529560b22189 |
15 | 266bbdb20da8 |
hex | 131e2ba2506d |
21020302004333 has 2 divisors, whose sum is σ = 21020302004334. Its totient is φ = 21020302004332.
The previous prime is 21020302004309. The next prime is 21020302004399. The reversal of 21020302004333 is 33340020302012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12567897085129 + 8452404919204 = 3545123^2 + 2907302^2 .
It is a cyclic number.
It is not a de Polignac number, because 21020302004333 - 26 = 21020302004269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21020302004299 and 21020302004308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21020302094333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10510151002166 + 10510151002167.
It is an arithmetic number, because the mean of its divisors is an integer number (10510151002167).
Almost surely, 221020302004333 is an apocalyptic number.
It is an amenable number.
21020302004333 is a deficient number, since it is larger than the sum of its proper divisors (1).
21020302004333 is an equidigital number, since it uses as much as digits as its factorization.
21020302004333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 21020302004333 its reverse (33340020302012), we get a palindrome (54360322306345).
The spelling of 21020302004333 in words is "twenty-one trillion, twenty billion, three hundred two million, four thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •