Base | Representation |
---|---|
bin | 1010000110101101001101… |
… | …1101011000001001101011 |
3 | 1110100010201012212221222011 |
4 | 2201223103131120021223 |
5 | 2424012430234334011 |
6 | 35344003325140351 |
7 | 2224460261221366 |
oct | 241532335301153 |
9 | 43303635787864 |
10 | 11110333121131 |
11 | 35a3958445942 |
12 | 12b53100ba6b7 |
13 | 62791394754a |
14 | 2a5a58ab10dd |
15 | 144012b54621 |
hex | a1ad375826b |
11110333121131 has 2 divisors, whose sum is σ = 11110333121132. Its totient is φ = 11110333121130.
The previous prime is 11110333121087. The next prime is 11110333121137. The reversal of 11110333121131 is 13112133301111.
11110333121131 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 is a cyclic number.
It is not a de Polignac number, because 11110333121131 - 225 = 11110299566699 is a prime.
It is a super-3 number, since 3×111103331211313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (11110333121137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555166560565 + 5555166560566.
It is an arithmetic number, because the mean of its divisors is an integer number (5555166560566).
Almost surely, 211110333121131 is an apocalyptic number.
11110333121131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110333121131 is an equidigital number, since it uses as much as digits as its factorization.
11110333121131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 22.
Adding to 11110333121131 its reverse (13112133301111), we get a palindrome (24222466422242).
The spelling of 11110333121131 in words is "eleven trillion, one hundred ten billion, three hundred thirty-three million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •