Base | Representation |
---|---|
bin | 1010000000111011000101… |
… | …1001111110010011000011 |
3 | 1102222122020221212021200122 |
4 | 2200032301121332103003 |
5 | 2420400440223240101 |
6 | 35230212342410455 |
7 | 2214342200646623 |
oct | 240166131762303 |
9 | 42878227767618 |
10 | 11010977555651 |
11 | 3565802857a57 |
12 | 129a002130a2b |
13 | 61b43b7c0808 |
14 | 2a0d11482883 |
15 | 14164a2b351b |
hex | a03b167e4c3 |
11010977555651 has 2 divisors, whose sum is σ = 11010977555652. Its totient is φ = 11010977555650.
The previous prime is 11010977555609. The next prime is 11010977555689. The reversal of 11010977555651 is 15655577901011.
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-11010977555651 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11010977555593 and 11010977555602.
It is not a weakly prime, because it can be changed into another prime (11010977555051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505488777825 + 5505488777826.
It is an arithmetic number, because the mean of its divisors is an integer number (5505488777826).
Almost surely, 211010977555651 is an apocalyptic number.
11010977555651 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010977555651 is an equidigital number, since it uses as much as digits as its factorization.
11010977555651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1653750, while the sum is 53.
The spelling of 11010977555651 in words is "eleven trillion, ten billion, nine hundred seventy-seven million, five hundred fifty-five thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •