Base | Representation |
---|---|
bin | 10000000000111110001… |
… | …110000110010101101111 |
3 | 10220012201121100122202211 |
4 | 100000332032012111233 |
5 | 121012414202324101 |
6 | 2201331020031251 |
7 | 142340535331405 |
oct | 20007616062557 |
9 | 3805647318684 |
10 | 1100555511151 |
11 | 394819992818 |
12 | 159365992527 |
13 | 7ca21bc80b5 |
14 | 3b3a518d475 |
15 | 1d964631c51 |
hex | 1003e38656f |
1100555511151 has 2 divisors, whose sum is σ = 1100555511152. Its totient is φ = 1100555511150.
The previous prime is 1100555511127. The next prime is 1100555511193. The reversal of 1100555511151 is 1511155550011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1100555511151 - 27 = 1100555511023 is a prime.
It is a super-2 number, since 2×11005555111512 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100555511751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550277755575 + 550277755576.
It is an arithmetic number, because the mean of its divisors is an integer number (550277755576).
Almost surely, 21100555511151 is an apocalyptic number.
1100555511151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100555511151 is an equidigital number, since it uses as much as digits as its factorization.
1100555511151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3125, while the sum is 31.
The spelling of 1100555511151 in words is "one trillion, one hundred billion, five hundred fifty-five million, five hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •