Base | Representation |
---|---|
bin | 10100100101111111… |
… | …01100110110011101 |
3 | 1001112112000102110002 |
4 | 22102333230312131 |
5 | 140120330410114 |
6 | 5025030424045 |
7 | 540660233561 |
oct | 122277546635 |
9 | 31475012402 |
10 | 11056106909 |
11 | 476397a841 |
12 | 2186802025 |
13 | 10727405c3 |
14 | 76c5176a1 |
15 | 44a9737de |
hex | 292fecd9d |
11056106909 has 2 divisors, whose sum is σ = 11056106910. Its totient is φ = 11056106908.
The previous prime is 11056106869. The next prime is 11056106933. The reversal of 11056106909 is 90960165011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10857014809 + 199092100 = 104197^2 + 14110^2 .
It is an emirp because it is prime and its reverse (90960165011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11056106909 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11056106989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5528053454 + 5528053455.
It is an arithmetic number, because the mean of its divisors is an integer number (5528053455).
Almost surely, 211056106909 is an apocalyptic number.
It is an amenable number.
11056106909 is a deficient number, since it is larger than the sum of its proper divisors (1).
11056106909 is an equidigital number, since it uses as much as digits as its factorization.
11056106909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 38.
The spelling of 11056106909 in words is "eleven billion, fifty-six million, one hundred six thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •