Base | Representation |
---|---|
bin | 101111110000001101010011… |
… | …000111001110011000100001 |
3 | 1000112121210220121110111202121 |
4 | 233300031103013032120201 |
5 | 210011441002023204303 |
6 | 2022402152053544241 |
7 | 62144342112553042 |
oct | 5760152307163041 |
9 | 1015553817414677 |
10 | 210021000209953 |
11 | 60a12451422989 |
12 | 1b67b588045081 |
13 | 9025b840a392a |
14 | 39c10dbbdc8c9 |
15 | 19431dc9719bd |
hex | bf03531ce621 |
210021000209953 has 2 divisors, whose sum is σ = 210021000209954. Its totient is φ = 210021000209952.
The previous prime is 210021000209927. The next prime is 210021000210001. The reversal of 210021000209953 is 359902000120012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 202020966974464 + 8000033235489 = 14213408^2 + 2828433^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210021000209953 is a prime.
It is not a weakly prime, because it can be changed into another prime (210021000249953) 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, 105010500104976 + 105010500104977.
It is an arithmetic number, because the mean of its divisors is an integer number (105010500104977).
Almost surely, 2210021000209953 is an apocalyptic number.
It is an amenable number.
210021000209953 is a deficient number, since it is larger than the sum of its proper divisors (1).
210021000209953 is an equidigital number, since it uses as much as digits as its factorization.
210021000209953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 34.
Adding to 210021000209953 its reverse (359902000120012), we get a palindrome (569923000329965).
The spelling of 210021000209953 in words is "two hundred ten trillion, twenty-one billion, two hundred nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •