Base | Representation |
---|---|
bin | 1001100011001011111100… |
… | …00100000101011111001101 |
3 | 2202100121012202020122102221 |
4 | 10301211332010011133031 |
5 | 10223031412242013123 |
6 | 112355210252015341 |
7 | 4265133532464502 |
oct | 461457604053715 |
9 | 82317182218387 |
10 | 21000210110413 |
11 | 6767159150aa6 |
12 | 2431b93a61551 |
13 | b94407c66761 |
14 | 5285b65594a9 |
15 | 2663e4ca225d |
hex | 13197e1057cd |
21000210110413 has 2 divisors, whose sum is σ = 21000210110414. Its totient is φ = 21000210110412.
The previous prime is 21000210110401. The next prime is 21000210110449. The reversal of 21000210110413 is 31401101200012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19801049326569 + 1199160783844 = 4449837^2 + 1095062^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21000210110413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21000210113413) 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, 10500105055206 + 10500105055207.
It is an arithmetic number, because the mean of its divisors is an integer number (10500105055207).
Almost surely, 221000210110413 is an apocalyptic number.
It is an amenable number.
21000210110413 is a deficient number, since it is larger than the sum of its proper divisors (1).
21000210110413 is an equidigital number, since it uses as much as digits as its factorization.
21000210110413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 21000210110413 its reverse (31401101200012), we get a palindrome (52401311310425).
The spelling of 21000210110413 in words is "twenty-one trillion, two hundred ten million, one hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •