Base | Representation |
---|---|
bin | 10000001111110111111… |
… | …101101010011010111001 |
3 | 10221202000202100120111002 |
4 | 100033313331222122321 |
5 | 121243202001312203 |
6 | 2212534500214345 |
7 | 143445213033266 |
oct | 20176775523271 |
9 | 3852022316432 |
10 | 1116556666553 |
11 | 3a0590147699 |
12 | 16049069a3b5 |
13 | 813a1c971a3 |
14 | 3c08234226d |
15 | 1e09e2a4d88 |
hex | 103f7f6a6b9 |
1116556666553 has 2 divisors, whose sum is σ = 1116556666554. Its totient is φ = 1116556666552.
The previous prime is 1116556666471. The next prime is 1116556666567. The reversal of 1116556666553 is 3556666556111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1114063362064 + 2493304489 = 1055492^2 + 49933^2 .
It is a cyclic number.
It is not a de Polignac number, because 1116556666553 - 212 = 1116556662457 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1116556666573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 558278333276 + 558278333277.
It is an arithmetic number, because the mean of its divisors is an integer number (558278333277).
Almost surely, 21116556666553 is an apocalyptic number.
It is an amenable number.
1116556666553 is a deficient number, since it is larger than the sum of its proper divisors (1).
1116556666553 is an equidigital number, since it uses as much as digits as its factorization.
1116556666553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14580000, while the sum is 56.
The spelling of 1116556666553 in words is "one trillion, one hundred sixteen billion, five hundred fifty-six million, six hundred sixty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •