Base | Representation |
---|---|
bin | 1010000110101111101100… |
… | …1101101111011111101011 |
3 | 1110100012102200221120011201 |
4 | 2201223323031233133223 |
5 | 2424020312012023313 |
6 | 35344153433105031 |
7 | 2224512640436455 |
oct | 241537315573753 |
9 | 43305380846151 |
10 | 11111000111083 |
11 | 35a416a999304 |
12 | 12b5477558177 |
13 | 6279bbb99862 |
14 | 2a5abd4d52d5 |
15 | 1440514a60dd |
hex | a1afb36f7eb |
11111000111083 has 2 divisors, whose sum is σ = 11111000111084. Its totient is φ = 11111000111082.
The previous prime is 11111000111047. The next prime is 11111000111111. The reversal of 11111000111083 is 38011100011111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11111000111083 - 217 = 11110999980011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11111000111083.
It is not a weakly prime, because it can be changed into another prime (11111000111483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555500055541 + 5555500055542.
It is an arithmetic number, because the mean of its divisors is an integer number (5555500055542).
Almost surely, 211111000111083 is an apocalyptic number.
11111000111083 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111000111083 is an equidigital number, since it uses as much as digits as its factorization.
11111000111083 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 19.
Adding to 11111000111083 its reverse (38011100011111), we get a palindrome (49122100122194).
It can be divided in two parts, 1111100011108 and 3, that added together give a palindrome (1111100011111).
The spelling of 11111000111083 in words is "eleven trillion, one hundred eleven billion, one hundred eleven thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •