Base | Representation |
---|---|
bin | 1010000110110000000110… |
… | …1110111011110101000001 |
3 | 1110100012201022201212011012 |
4 | 2201230001232323311001 |
5 | 2424021023011210044 |
6 | 35344212341130305 |
7 | 2224515436143551 |
oct | 241540156736501 |
9 | 43305638655135 |
10 | 11111109475649 |
11 | 35a42166a6547 |
12 | 12b54a80b9995 |
13 | 627a0873b911 |
14 | 2a5acdc43161 |
15 | 14405adaa59e |
hex | a1b01bbbd41 |
11111109475649 has 2 divisors, whose sum is σ = 11111109475650. Its totient is φ = 11111109475648.
The previous prime is 11111109475643. The next prime is 11111109475657. The reversal of 11111109475649 is 94657490111111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10963648099600 + 147461376049 = 3311140^2 + 384007^2 .
It is an emirp because it is prime and its reverse (94657490111111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11111109475649 - 232 = 11106814508353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11111109475597 and 11111109475606.
It is not a weakly prime, because it can be changed into another prime (11111109475643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555554737824 + 5555554737825.
It is an arithmetic number, because the mean of its divisors is an integer number (5555554737825).
Almost surely, 211111109475649 is an apocalyptic number.
It is an amenable number.
11111109475649 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111109475649 is an equidigital number, since it uses as much as digits as its factorization.
11111109475649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 50.
The spelling of 11111109475649 in words is "eleven trillion, one hundred eleven billion, one hundred nine million, four hundred seventy-five thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •