Base | Representation |
---|---|
bin | 10100100100000101… |
… | …01011011011110111 |
3 | 1001111101220201021002 |
4 | 22102002223123313 |
5 | 140102232012302 |
6 | 5023255513515 |
7 | 540404250401 |
oct | 122202533367 |
9 | 31441821232 |
10 | 11040110327 |
11 | 4755944324 |
12 | 218138889b |
13 | 106c32c47c |
14 | 76a351b71 |
15 | 449363c02 |
hex | 2920ab6f7 |
11040110327 has 2 divisors, whose sum is σ = 11040110328. Its totient is φ = 11040110326.
The previous prime is 11040110273. The next prime is 11040110353. The reversal of 11040110327 is 72301104011.
It is a happy number.
Together with previous prime (11040110273) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11040110327 - 210 = 11040109303 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11040110299 and 11040110308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11040110827) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5520055163 + 5520055164.
It is an arithmetic number, because the mean of its divisors is an integer number (5520055164).
Almost surely, 211040110327 is an apocalyptic number.
11040110327 is a deficient number, since it is larger than the sum of its proper divisors (1).
11040110327 is an equidigital number, since it uses as much as digits as its factorization.
11040110327 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 11040110327 its reverse (72301104011), we get a palindrome (83341214338).
The spelling of 11040110327 in words is "eleven billion, forty million, one hundred ten thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •