Base | Representation |
---|---|
bin | 1010000001100000110101… |
… | …1110100111011010111001 |
3 | 1110000121102021000010101221 |
4 | 2200120031132213122321 |
5 | 2421032214211224004 |
6 | 35235010135312041 |
7 | 2215151302052266 |
oct | 240301536473271 |
9 | 43017367003357 |
10 | 11021112211129 |
11 | 356a033583689 |
12 | 129bb7021b621 |
13 | 61c395366787 |
14 | 2a15d345826d |
15 | 141a3edbe354 |
hex | a060d7a76b9 |
11021112211129 has 2 divisors, whose sum is σ = 11021112211130. Its totient is φ = 11021112211128.
The previous prime is 11021112211079. The next prime is 11021112211139. The reversal of 11021112211129 is 92111221112011.
11021112211129 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7938447125625 + 3082665085504 = 2817525^2 + 1755752^2 .
It is an emirp because it is prime and its reverse (92111221112011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11021112211129 - 29 = 11021112210617 is a prime.
It is not a weakly prime, because it can be changed into another prime (11021112211139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510556105564 + 5510556105565.
It is an arithmetic number, because the mean of its divisors is an integer number (5510556105565).
Almost surely, 211021112211129 is an apocalyptic number.
It is an amenable number.
11021112211129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021112211129 is an equidigital number, since it uses as much as digits as its factorization.
11021112211129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 25.
The spelling of 11021112211129 in words is "eleven trillion, twenty-one billion, one hundred twelve million, two hundred eleven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •