Base | Representation |
---|---|
bin | 10100101100100010… |
… | …00110011110100001 |
3 | 1001200100022021120101 |
4 | 22112101012132201 |
5 | 140223403444334 |
6 | 5034311142401 |
7 | 542224640626 |
oct | 122621063641 |
9 | 31610267511 |
10 | 11110999969 |
11 | 4791962803 |
12 | 21a1074a01 |
13 | 1080c1cbc4 |
14 | 77592634d |
15 | 4506b8214 |
hex | 2964467a1 |
11110999969 has 2 divisors, whose sum is σ = 11110999970. Its totient is φ = 11110999968.
The previous prime is 11110999849. The next prime is 11110999979. The reversal of 11110999969 is 96999901111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8441934400 + 2669065569 = 91880^2 + 51663^2 .
It is a cyclic number.
It is not a de Polignac number, because 11110999969 - 231 = 8963516321 is a prime.
It is a super-2 number, since 2×111109999692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11110999979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555499984 + 5555499985.
It is an arithmetic number, because the mean of its divisors is an integer number (5555499985).
Almost surely, 211110999969 is an apocalyptic number.
It is an amenable number.
11110999969 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110999969 is an equidigital number, since it uses as much as digits as its factorization.
11110999969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 354294, while the sum is 55.
The spelling of 11110999969 in words is "eleven billion, one hundred ten million, nine hundred ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •