Base | Representation |
---|---|
bin | 1010000110101100011101… |
… | …1110001101000000111111 |
3 | 1110100010012012110111211102 |
4 | 2201223013132031000333 |
5 | 2424012022243323241 |
6 | 35343531342443315 |
7 | 2224452266631602 |
oct | 241530736150077 |
9 | 43303165414742 |
10 | 11110132011071 |
11 | 35a3864974985 |
12 | 12b527489353b |
13 | 6278b1091c02 |
14 | 2a5a3a0c0339 |
15 | 14400017b39b |
hex | a1ac778d03f |
11110132011071 has 2 divisors, whose sum is σ = 11110132011072. Its totient is φ = 11110132011070.
The previous prime is 11110132011047. The next prime is 11110132011109. The reversal of 11110132011071 is 17011023101111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11110132011071 - 230 = 11109058269247 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11110132011871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555066005535 + 5555066005536.
It is an arithmetic number, because the mean of its divisors is an integer number (5555066005536).
Almost surely, 211110132011071 is an apocalyptic number.
11110132011071 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110132011071 is an equidigital number, since it uses as much as digits as its factorization.
11110132011071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 20.
Adding to 11110132011071 its reverse (17011023101111), we get a palindrome (28121155112182).
The spelling of 11110132011071 in words is "eleven trillion, one hundred ten billion, one hundred thirty-two million, eleven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •