Base | Representation |
---|---|
bin | 1001100110011110001110… |
… | …00001000011011111100101 |
3 | 2202202101121110111220202112 |
4 | 10303033013001003133211 |
5 | 10231404113404433102 |
6 | 112523120430450405 |
7 | 4306241244104222 |
oct | 463170701033745 |
9 | 82671543456675 |
10 | 21113103202277 |
11 | 6800020381919 |
12 | 244ba3b663a05 |
13 | ba1c59955c28 |
14 | 52dc45a76949 |
15 | 269300d72252 |
hex | 1333c70437e5 |
21113103202277 has 2 divisors, whose sum is σ = 21113103202278. Its totient is φ = 21113103202276.
The previous prime is 21113103202273. The next prime is 21113103202381. The reversal of 21113103202277 is 77220230131112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16984075138276 + 4129028064001 = 4121174^2 + 2032001^2 .
It is a cyclic number.
It is not a de Polignac number, because 21113103202277 - 22 = 21113103202273 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21113103202271) 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, 10556551601138 + 10556551601139.
It is an arithmetic number, because the mean of its divisors is an integer number (10556551601139).
Almost surely, 221113103202277 is an apocalyptic number.
It is an amenable number.
21113103202277 is a deficient number, since it is larger than the sum of its proper divisors (1).
21113103202277 is an equidigital number, since it uses as much as digits as its factorization.
21113103202277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 32.
Adding to 21113103202277 its reverse (77220230131112), we get a palindrome (98333333333389).
The spelling of 21113103202277 in words is "twenty-one trillion, one hundred thirteen billion, one hundred three million, two hundred two thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •