Base | Representation |
---|---|
bin | 1001101100100101001011… |
… | …10111000011101100101001 |
3 | 2210111110101112222211120211 |
4 | 10312102211313003230221 |
5 | 10243324001041043144 |
6 | 113203352350421121 |
7 | 4330351553212114 |
oct | 466224567035451 |
9 | 83443345884524 |
10 | 21323000331049 |
11 | 688104088538a |
12 | 24846598017a1 |
13 | bb899a554c01 |
14 | 53a07837d57b |
15 | 26e9d8134034 |
hex | 1364a5dc3b29 |
21323000331049 has 2 divisors, whose sum is σ = 21323000331050. Its totient is φ = 21323000331048.
The previous prime is 21323000330993. The next prime is 21323000331079. The reversal of 21323000331049 is 94013300032312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21051395712400 + 271604618649 = 4588180^2 + 521157^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21323000331049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21323000331049.
It is not a weakly prime, because it can be changed into another prime (21323000331079) 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, 10661500165524 + 10661500165525.
It is an arithmetic number, because the mean of its divisors is an integer number (10661500165525).
Almost surely, 221323000331049 is an apocalyptic number.
It is an amenable number.
21323000331049 is a deficient number, since it is larger than the sum of its proper divisors (1).
21323000331049 is an equidigital number, since it uses as much as digits as its factorization.
21323000331049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 31.
The spelling of 21323000331049 in words is "twenty-one trillion, three hundred twenty-three billion, three hundred thirty-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •