Base | Representation |
---|---|
bin | 1001100110101101010011… |
… | …01000010001110100111001 |
3 | 2202210011111202021002001212 |
4 | 10303112221220101310321 |
5 | 10232022204211241323 |
6 | 112530540111252505 |
7 | 4306646012450024 |
oct | 463265150216471 |
9 | 82704452232055 |
10 | 21121200102713 |
11 | 68034a5913a77 |
12 | 245151b21a135 |
13 | ba294a295a89 |
14 | 5303b31661bb |
15 | 269626b0db78 |
hex | 1335a9a11d39 |
21121200102713 has 2 divisors, whose sum is σ = 21121200102714. Its totient is φ = 21121200102712.
The previous prime is 21121200102679. The next prime is 21121200102757. The reversal of 21121200102713 is 31720100212112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18378609072784 + 2742591029929 = 4287028^2 + 1656077^2 .
It is a cyclic number.
It is not a de Polignac number, because 21121200102713 - 242 = 16723153591609 is a prime.
It is a super-2 number, since 2×211212001027132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21121200102113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560600051356 + 10560600051357.
It is an arithmetic number, because the mean of its divisors is an integer number (10560600051357).
Almost surely, 221121200102713 is an apocalyptic number.
It is an amenable number.
21121200102713 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121200102713 is an equidigital number, since it uses as much as digits as its factorization.
21121200102713 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 21121200102713 its reverse (31720100212112), we get a palindrome (52841300314825).
The spelling of 21121200102713 in words is "twenty-one trillion, one hundred twenty-one billion, two hundred million, one hundred two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •