Base | Representation |
---|---|
bin | 11001010001000001100000… |
… | …011001010001111101001111 |
3 | 112120110001202022202010201111 |
4 | 121101001200121101331033 |
5 | 104031101312321400444 |
6 | 1032200142054352451 |
7 | 32256141150033544 |
oct | 3121014031217517 |
9 | 476401668663644 |
10 | 111121011121999 |
11 | 3245217995011a |
12 | 10567bb595b727 |
13 | 4a008880869a8 |
14 | 1d623ddad4bcb |
15 | cca7a4aab234 |
hex | 651060651f4f |
111121011121999 has 2 divisors, whose sum is σ = 111121011122000. Its totient is φ = 111121011121998.
The previous prime is 111121011121993. The next prime is 111121011122053. The reversal of 111121011121999 is 999121110121111.
It is a weak prime.
It is an emirp because it is prime and its reverse (999121110121111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111121011121999 is a prime.
It is a super-2 number, since 2×1111210111219992 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111121011121993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55560505560999 + 55560505561000.
It is an arithmetic number, because the mean of its divisors is an integer number (55560505561000).
Almost surely, 2111121011121999 is an apocalyptic number.
111121011121999 is a deficient number, since it is larger than the sum of its proper divisors (1).
111121011121999 is an equidigital number, since it uses as much as digits as its factorization.
111121011121999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 40.
The spelling of 111121011121999 in words is "one hundred eleven trillion, one hundred twenty-one billion, eleven million, one hundred twenty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •