Base | Representation |
---|---|
bin | 10100101011111110… |
… | …10001110101000101 |
3 | 1001200000111220122221 |
4 | 22111333101311011 |
5 | 140221204443002 |
6 | 5034023052341 |
7 | 542140141441 |
oct | 122577216505 |
9 | 31600456587 |
10 | 11106327877 |
11 | 478a261577 |
12 | 219b5a10b1 |
13 | 107cc75458 |
14 | 77506b821 |
15 | 450093c37 |
hex | 295fd1d45 |
11106327877 has 2 divisors, whose sum is σ = 11106327878. Its totient is φ = 11106327876.
The previous prime is 11106327823. The next prime is 11106327901. The reversal of 11106327877 is 77872360111.
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., 10581413956 + 524913921 = 102866^2 + 22911^2 .
It is a cyclic number.
It is not a de Polignac number, because 11106327877 - 211 = 11106325829 is a prime.
It is a super-2 number, since 2×111063278772 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11146327877) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5553163938 + 5553163939.
It is an arithmetic number, because the mean of its divisors is an integer number (5553163939).
Almost surely, 211106327877 is an apocalyptic number.
It is an amenable number.
11106327877 is a deficient number, since it is larger than the sum of its proper divisors (1).
11106327877 is an equidigital number, since it uses as much as digits as its factorization.
11106327877 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 98784, while the sum is 43.
Adding to 11106327877 its reverse (77872360111), we get a palindrome (88978687988).
The spelling of 11106327877 in words is "eleven billion, one hundred six million, three hundred twenty-seven thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •