Base | Representation |
---|---|
bin | 1010000001100000110101… |
… | …1101111001000011001101 |
3 | 1110000121102020122110212102 |
4 | 2200120031131321003031 |
5 | 2421032214134134242 |
6 | 35235010131244445 |
7 | 2215151300331455 |
oct | 240301535710315 |
9 | 43017366573772 |
10 | 11021112021197 |
11 | 356a033463a13 |
12 | 129bb70149725 |
13 | 61c3952cb1a5 |
14 | 2a15d3408d65 |
15 | 141a3ed82e32 |
hex | a060d7790cd |
11021112021197 has 2 divisors, whose sum is σ = 11021112021198. Its totient is φ = 11021112021196.
The previous prime is 11021112021191. The next prime is 11021112021203. The reversal of 11021112021197 is 79112021112011.
It is a balanced prime because it is at equal distance from previous prime (11021112021191) and next prime (11021112021203).
It can be written as a sum of positive squares in only one way, i.e., 10982953914916 + 38158106281 = 3314054^2 + 195341^2 .
It is an emirp because it is prime and its reverse (79112021112011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11021112021197 - 24 = 11021112021181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021112021191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510556010598 + 5510556010599.
It is an arithmetic number, because the mean of its divisors is an integer number (5510556010599).
Almost surely, 211021112021197 is an apocalyptic number.
It is an amenable number.
11021112021197 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021112021197 is an equidigital number, since it uses as much as digits as its factorization.
11021112021197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 29.
The spelling of 11021112021197 in words is "eleven trillion, twenty-one billion, one hundred twelve million, twenty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •