Base | Representation |
---|---|
bin | 110011110101010110… |
… | …1100101010001101110 |
3 | 101122022112011111011202 |
4 | 1213222231211101232 |
5 | 3310431333000420 |
6 | 123045214245502 |
7 | 11020262250443 |
oct | 1475255452156 |
9 | 348275144152 |
10 | 111312000110 |
11 | 432307a4223 |
12 | 196a61b6892 |
13 | a65c276c2c |
14 | 555d5499ca |
15 | 2d673a8575 |
hex | 19eab6546e |
111312000110 has 8 divisors (see below), whose sum is σ = 200361600216. Its totient is φ = 44524800040.
The previous prime is 111312000103. The next prime is 111312000113. The reversal of 111312000110 is 11000213111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1113120001102 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111312000091 and 111312000100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111312000113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5565599996 + ... + 5565600015.
It is an arithmetic number, because the mean of its divisors is an integer number (25045200027).
Almost surely, 2111312000110 is an apocalyptic number.
111312000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111312000110 is a deficient number, since it is larger than the sum of its proper divisors (89049600106).
111312000110 is a wasteful number, since it uses less digits than its factorization.
111312000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11131200018.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 111312000110 its reverse (11000213111), we get a palindrome (122312213221).
The spelling of 111312000110 in words is "one hundred eleven billion, three hundred twelve million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •