Base | Representation |
---|---|
bin | 1010000110110000000100… |
… | …1010110010011011100001 |
3 | 1110100012200122220102222002 |
4 | 2201230001022302123201 |
5 | 2424021013044444334 |
6 | 35344211402053345 |
7 | 2224515262456634 |
oct | 241540112623341 |
9 | 43305618812862 |
10 | 11111099999969 |
11 | 35a4211314302 |
12 | 12b54a4aaa255 |
13 | 627a067a18c8 |
14 | 2a5acc897c1b |
15 | 14405a137b7e |
hex | a1b012b26e1 |
11111099999969 has 2 divisors, whose sum is σ = 11111099999970. Its totient is φ = 11111099999968.
The previous prime is 11111099999959. The next prime is 11111100000023. The reversal of 11111099999969 is 96999999011111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10760236878400 + 350863121569 = 3280280^2 + 592337^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111099999969 - 212 = 11111099995873 is a prime.
It is a super-2 number, since 2×111110999999692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11111099999896 and 11111099999905.
It is not a weakly prime, because it can be changed into another prime (11111099999959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555549999984 + 5555549999985.
It is an arithmetic number, because the mean of its divisors is an integer number (5555549999985).
Almost surely, 211111099999969 is an apocalyptic number.
It is an amenable number.
11111099999969 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111099999969 is an equidigital number, since it uses as much as digits as its factorization.
11111099999969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28697814, while the sum is 74.
The spelling of 11111099999969 in words is "eleven trillion, one hundred eleven billion, ninety-nine million, nine hundred ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •