Base | Representation |
---|---|
bin | 10100101101010000… |
… | …00000100001010001 |
3 | 1001200202121100202112 |
4 | 22112220000201101 |
5 | 140231423124011 |
6 | 5035043555105 |
7 | 542326660643 |
oct | 122650004121 |
9 | 31622540675 |
10 | 11117004881 |
11 | 4795294344 |
12 | 21a308ba95 |
13 | 10822431c8 |
14 | 77664a893 |
15 | 450ea258b |
hex | 296a00851 |
11117004881 has 2 divisors, whose sum is σ = 11117004882. Its totient is φ = 11117004880.
The previous prime is 11117004859. The next prime is 11117004907. The reversal of 11117004881 is 18840071111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8327475025 + 2789529856 = 91255^2 + 52816^2 .
It is an emirp because it is prime and its reverse (18840071111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11117004881 - 210 = 11117003857 is a prime.
It is a super-2 number, since 2×111170048812 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11117004781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5558502440 + 5558502441.
It is an arithmetic number, because the mean of its divisors is an integer number (5558502441).
Almost surely, 211117004881 is an apocalyptic number.
It is an amenable number.
11117004881 is a deficient number, since it is larger than the sum of its proper divisors (1).
11117004881 is an equidigital number, since it uses as much as digits as its factorization.
11117004881 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 32.
Adding to 11117004881 its reverse (18840071111), we get a palindrome (29957075992).
The spelling of 11117004881 in words is "eleven billion, one hundred seventeen million, four thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •