Base | Representation |
---|---|
bin | 1100011010101101111… |
… | …0111001001101111001 |
3 | 202101122100210011201102 |
4 | 3012223132321031321 |
5 | 11443400040300441 |
6 | 242000322501145 |
7 | 21261345324206 |
oct | 3065336711571 |
9 | 671570704642 |
10 | 213330400121 |
11 | 825224a4103 |
12 | 35417b047b5 |
13 | 17169ca3ab7 |
14 | a47a694cad |
15 | 58388dc69b |
hex | 31ab7b9379 |
213330400121 has 2 divisors, whose sum is σ = 213330400122. Its totient is φ = 213330400120.
The previous prime is 213330400051. The next prime is 213330400159. The reversal of 213330400121 is 121004033312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 175309690000 + 38020710121 = 418700^2 + 194989^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213330400121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213330400093 and 213330400102.
It is not a weakly prime, because it can be changed into another prime (213330400021) 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, 106665200060 + 106665200061.
It is an arithmetic number, because the mean of its divisors is an integer number (106665200061).
Almost surely, 2213330400121 is an apocalyptic number.
It is an amenable number.
213330400121 is a deficient number, since it is larger than the sum of its proper divisors (1).
213330400121 is an equidigital number, since it uses as much as digits as its factorization.
213330400121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 213330400121 its reverse (121004033312), we get a palindrome (334334433433).
The spelling of 213330400121 in words is "two hundred thirteen billion, three hundred thirty million, four hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •