Base | Representation |
---|---|
bin | 11001010000111000010001… |
… | …101001010110011011111100 |
3 | 112120102010011121012222021210 |
4 | 121100320101221112123330 |
5 | 104030421013044444441 |
6 | 1032151422404524420 |
7 | 32255340431632245 |
oct | 3120702151263374 |
9 | 476363147188253 |
10 | 111111099999996 |
11 | 32448a533204a8 |
12 | 105660aa6b0710 |
13 | 49cc968917865 |
14 | 1d61b3d6a9ccc |
15 | cca3c4907616 |
hex | 650e11a566fc |
111111099999996 has 12 divisors (see below), whose sum is σ = 259259233333352. Its totient is φ = 37037033333328.
The previous prime is 111111099999979. The next prime is 111111099999997. The reversal of 111111099999996 is 699999990111111.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1111110999999962 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111111099999997) 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 in 3 ways as a sum of consecutive naturals, for example, 4629629166655 + ... + 4629629166678.
Almost surely, 2111111099999996 is an apocalyptic number.
It is an amenable number.
111111099999996 is an abundant number, since it is smaller than the sum of its proper divisors (148148133333356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111111099999996 is a wasteful number, since it uses less digits than its factorization.
111111099999996 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9259258333340 (or 9259258333338 counting only the distinct ones).
The product of its (nonzero) digits is 28697814, while the sum is 75.
The spelling of 111111099999996 in words is "one hundred eleven trillion, one hundred eleven billion, ninety-nine million, nine hundred ninety-nine thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •