Base | Representation |
---|---|
bin | 1001101100100101100011… |
… | …11100001100001110111001 |
3 | 2210111110220200100122200021 |
4 | 10312102301330030032321 |
5 | 10243324404432101241 |
6 | 113203424430410441 |
7 | 4330356563666302 |
oct | 466226174141671 |
9 | 83443820318607 |
10 | 21323203003321 |
11 | 688113522302a |
12 | 24846b5660a21 |
13 | bb8a0053662b |
14 | 53a0972597a9 |
15 | 26e9ead1a0d1 |
hex | 1364b1f0c3b9 |
21323203003321 has 2 divisors, whose sum is σ = 21323203003322. Its totient is φ = 21323203003320.
The previous prime is 21323203003309. The next prime is 21323203003337. The reversal of 21323203003321 is 12330030232312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20995090561600 + 328112441721 = 4582040^2 + 572811^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21323203003321 is a prime.
It is not a weakly prime, because it can be changed into another prime (21323203003381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10661601501660 + 10661601501661.
It is an arithmetic number, because the mean of its divisors is an integer number (10661601501661).
Almost surely, 221323203003321 is an apocalyptic number.
It is an amenable number.
21323203003321 is a deficient number, since it is larger than the sum of its proper divisors (1).
21323203003321 is an equidigital number, since it uses as much as digits as its factorization.
21323203003321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 21323203003321 its reverse (12330030232312), we get a palindrome (33653233235633).
The spelling of 21323203003321 in words is "twenty-one trillion, three hundred twenty-three billion, two hundred three million, three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •