Base | Representation |
---|---|
bin | 1010000111111011010101… |
… | …0111111101011100100101 |
3 | 1110102010211122211102002202 |
4 | 2201332311113331130211 |
5 | 2424333402111033104 |
6 | 35401352231144245 |
7 | 2226132033145025 |
oct | 241766527753445 |
9 | 43363748742082 |
10 | 11131303221029 |
11 | 3601839526312 |
12 | 12b93a2b15085 |
13 | 6298a62c0994 |
14 | 2a6a87b5da85 |
15 | 14483db4751e |
hex | a1fb55fd725 |
11131303221029 has 2 divisors, whose sum is σ = 11131303221030. Its totient is φ = 11131303221028.
The previous prime is 11131303220993. The next prime is 11131303221041. The reversal of 11131303221029 is 92012230313111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11062289304004 + 69013917025 = 3326002^2 + 262705^2 .
It is a cyclic number.
It is not a de Polignac number, because 11131303221029 - 220 = 11131302172453 is a prime.
It is a super-2 number, since 2×111313032210292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11131303220992 and 11131303221010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11131303220029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565651610514 + 5565651610515.
It is an arithmetic number, because the mean of its divisors is an integer number (5565651610515).
Almost surely, 211131303221029 is an apocalyptic number.
It is an amenable number.
11131303221029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11131303221029 is an equidigital number, since it uses as much as digits as its factorization.
11131303221029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 11131303221029 in words is "eleven trillion, one hundred thirty-one billion, three hundred three million, two hundred twenty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •