Base | Representation |
---|---|
bin | 1010000001000011011100… |
… | …1001001110001010011001 |
3 | 1102222212001022212212120101 |
4 | 2200100313021032022121 |
5 | 2420420034123424004 |
6 | 35231223134055401 |
7 | 2214451614365032 |
oct | 240206711161231 |
9 | 42885038785511 |
10 | 11013221311129 |
11 | 3566754352724 |
12 | 129a52964a561 |
13 | 61b70860218b |
14 | 2a108546da89 |
15 | 14172c274ba4 |
hex | a043724e299 |
11013221311129 has 2 divisors, whose sum is σ = 11013221311130. Its totient is φ = 11013221311128.
The previous prime is 11013221311109. The next prime is 11013221311139. The reversal of 11013221311129 is 92111312231011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10368174601225 + 645046709904 = 3219965^2 + 803148^2 .
It is an emirp because it is prime and its reverse (92111312231011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11013221311129 - 239 = 10463465497241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11013221311097 and 11013221311106.
It is not a weakly prime, because it can be changed into another prime (11013221311109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506610655564 + 5506610655565.
It is an arithmetic number, because the mean of its divisors is an integer number (5506610655565).
Almost surely, 211013221311129 is an apocalyptic number.
It is an amenable number.
11013221311129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013221311129 is an equidigital number, since it uses as much as digits as its factorization.
11013221311129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 28.
The spelling of 11013221311129 in words is "eleven trillion, thirteen billion, two hundred twenty-one million, three hundred eleven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •