Base | Representation |
---|---|
bin | 1001100110000110000010… |
… | …01110101001110110110101 |
3 | 2202201011002201120222102012 |
4 | 10303003001032221312311 |
5 | 10231201022011431401 |
6 | 112513132321254005 |
7 | 4305301446655214 |
oct | 463030116516665 |
9 | 82634081528365 |
10 | 21100121202101 |
11 | 67a5569380a57 |
12 | 2449417a94305 |
13 | ba096b217116 |
14 | 52d37387507b |
15 | 268ce12c88bb |
hex | 1330c13a9db5 |
21100121202101 has 2 divisors, whose sum is σ = 21100121202102. Its totient is φ = 21100121202100.
The previous prime is 21100121202077. The next prime is 21100121202119. The reversal of 21100121202101 is 10120212100112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17032739801476 + 4067381400625 = 4127074^2 + 2016775^2 .
It is a cyclic number.
It is not a de Polignac number, because 21100121202101 - 210 = 21100121201077 is a prime.
It is a super-2 number, since 2×211001212021012 (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 (21100121207101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10550060601050 + 10550060601051.
It is an arithmetic number, because the mean of its divisors is an integer number (10550060601051).
Almost surely, 221100121202101 is an apocalyptic number.
It is an amenable number.
21100121202101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21100121202101 is an equidigital number, since it uses as much as digits as its factorization.
21100121202101 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 14.
Adding to 21100121202101 its reverse (10120212100112), we get a palindrome (31220333302213).
The spelling of 21100121202101 in words is "twenty-one trillion, one hundred billion, one hundred twenty-one million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •