Base | Representation |
---|---|
bin | 10000000101001010001… |
… | …011000011001001101111 |
3 | 10220122022220102102202102 |
4 | 100011022023003021233 |
5 | 121101121024134201 |
6 | 2203353050045315 |
7 | 142560123365153 |
oct | 20051213031157 |
9 | 3818286372672 |
10 | 1105051005551 |
11 | 396716536249 |
12 | 15a1bb41983b |
13 | 8028a384b5c |
14 | 3b6b0245063 |
15 | 1db2913026b |
hex | 1014a2c326f |
1105051005551 has 2 divisors, whose sum is σ = 1105051005552. Its totient is φ = 1105051005550.
The previous prime is 1105051005533. The next prime is 1105051005557. The reversal of 1105051005551 is 1555001505011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1105051005551 is a prime.
It is a super-2 number, since 2×11050510055512 (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 (1105051005557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552525502775 + 552525502776.
It is an arithmetic number, because the mean of its divisors is an integer number (552525502776).
Almost surely, 21105051005551 is an apocalyptic number.
1105051005551 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105051005551 is an equidigital number, since it uses as much as digits as its factorization.
1105051005551 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 29.
The spelling of 1105051005551 in words is "one trillion, one hundred five billion, fifty-one million, five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •