Base | Representation |
---|---|
bin | 10100101100100010… |
… | …01000111010110001 |
3 | 1001200100022210021202 |
4 | 22112101020322301 |
5 | 140223404304334 |
6 | 5034311300545 |
7 | 542225012033 |
oct | 122621107261 |
9 | 31610283252 |
10 | 11111009969 |
11 | 479196a274 |
12 | 21a107a755 |
13 | 1080c24617 |
14 | 775929c53 |
15 | 4506bb17e |
hex | 296448eb1 |
11111009969 has 2 divisors, whose sum is σ = 11111009970. Its totient is φ = 11111009968.
The previous prime is 11111009953. The next prime is 11111010037. The reversal of 11111009969 is 96990011111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10057682944 + 1053327025 = 100288^2 + 32455^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111009969 - 24 = 11111009953 is a prime.
It is a super-2 number, since 2×111110099692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11111009669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555504984 + 5555504985.
It is an arithmetic number, because the mean of its divisors is an integer number (5555504985).
Almost surely, 211111009969 is an apocalyptic number.
It is an amenable number.
11111009969 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111009969 is an equidigital number, since it uses as much as digits as its factorization.
11111009969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 38.
The spelling of 11111009969 in words is "eleven billion, one hundred eleven million, nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •