Base | Representation |
---|---|
bin | 1001101100110010011101… |
… | …11101010111000001100001 |
3 | 2210112010210121001101120022 |
4 | 10312121032331113001201 |
5 | 10243433102332043443 |
6 | 113210532201323225 |
7 | 4331023364022125 |
oct | 466311675270141 |
9 | 83463717041508 |
10 | 21330132299873 |
11 | 68840706760a1 |
12 | 2485b0a196515 |
13 | bb9565cb57c7 |
14 | 53a55364d585 |
15 | 26eca4319e68 |
hex | 13664ef57061 |
21330132299873 has 2 divisors, whose sum is σ = 21330132299874. Its totient is φ = 21330132299872.
The previous prime is 21330132299857. The next prime is 21330132299909. The reversal of 21330132299873 is 37899223103312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12869811852304 + 8460320447569 = 3587452^2 + 2908663^2 .
It is a cyclic number.
It is not a de Polignac number, because 21330132299873 - 24 = 21330132299857 is a prime.
It is a super-2 number, since 2×213301322998732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21330132299173) 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, 10665066149936 + 10665066149937.
It is an arithmetic number, because the mean of its divisors is an integer number (10665066149937).
Almost surely, 221330132299873 is an apocalyptic number.
It is an amenable number.
21330132299873 is a deficient number, since it is larger than the sum of its proper divisors (1).
21330132299873 is an equidigital number, since it uses as much as digits as its factorization.
21330132299873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2939328, while the sum is 53.
The spelling of 21330132299873 in words is "twenty-one trillion, three hundred thirty billion, one hundred thirty-two million, two hundred ninety-nine thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •