Base | Representation |
---|---|
bin | 1001100011011110001100… |
… | …01100011111111101000001 |
3 | 2202101112111201212021220111 |
4 | 10301233012030133331001 |
5 | 10223212000103210423 |
6 | 112403510534111321 |
7 | 4265631432115651 |
oct | 461570614377501 |
9 | 82345451767814 |
10 | 21010010210113 |
11 | 6770328040a51 |
12 | 2433a69aab541 |
13 | b9530a403112 |
14 | 528c65d24361 |
15 | 2667ba32560d |
hex | 131bc631ff41 |
21010010210113 has 2 divisors, whose sum is σ = 21010010210114. Its totient is φ = 21010010210112.
The previous prime is 21010010210089. The next prime is 21010010210117. The reversal of 21010010210113 is 31101201001012.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14092726224784 + 6917283985329 = 3754028^2 + 2630073^2 .
It is a cyclic number.
It is not a de Polignac number, because 21010010210113 - 229 = 21009473339201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21010010210093 and 21010010210102.
It is not a weakly prime, because it can be changed into another prime (21010010210117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10505005105056 + 10505005105057.
It is an arithmetic number, because the mean of its divisors is an integer number (10505005105057).
Almost surely, 221010010210113 is an apocalyptic number.
It is an amenable number.
21010010210113 is a deficient number, since it is larger than the sum of its proper divisors (1).
21010010210113 is an equidigital number, since it uses as much as digits as its factorization.
21010010210113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 21010010210113 its reverse (31101201001012), we get a palindrome (52111211211125).
The spelling of 21010010210113 in words is "twenty-one trillion, ten billion, ten million, two hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •