Base | Representation |
---|---|
bin | 1001101001000000010011… |
… | …01000100011111110001101 |
3 | 2210001201012211100110112211 |
4 | 10310200021220203332031 |
5 | 10234320321232413401 |
6 | 113031111211030421 |
7 | 4315441512304312 |
oct | 464401150437615 |
9 | 83051184313484 |
10 | 21200120201101 |
11 | 6833a14192a86 |
12 | 246488543b411 |
13 | baa21676604a |
14 | 53413c714d09 |
15 | 26b6e53b6951 |
hex | 134809a23f8d |
21200120201101 has 2 divisors, whose sum is σ = 21200120201102. Its totient is φ = 21200120201100.
The previous prime is 21200120201023. The next prime is 21200120201119. The reversal of 21200120201101 is 10110202100212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13451546493225 + 7748573707876 = 3667635^2 + 2783626^2 .
It is a cyclic number.
It is not a de Polignac number, because 21200120201101 - 235 = 21165760462733 is a prime.
It is a super-2 number, since 2×212001202011012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21200120201171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600060100550 + 10600060100551.
It is an arithmetic number, because the mean of its divisors is an integer number (10600060100551).
Almost surely, 221200120201101 is an apocalyptic number.
It is an amenable number.
21200120201101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21200120201101 is an equidigital number, since it uses as much as digits as its factorization.
21200120201101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21200120201101 its reverse (10110202100212), we get a palindrome (31310322301313).
The spelling of 21200120201101 in words is "twenty-one trillion, two hundred billion, one hundred twenty million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •