Base | Representation |
---|---|
bin | 110011101111000010… |
… | …1010000010110001111 |
3 | 101121202202102221122202 |
4 | 1213132011100112033 |
5 | 3310013111231111 |
6 | 123012204432115 |
7 | 11012110200002 |
oct | 1473605202617 |
9 | 347682387582 |
10 | 111100102031 |
11 | 43132125046 |
12 | 1964724863b |
13 | a6273b5159 |
14 | 553d34b539 |
15 | 2d5399db3b |
hex | 19de15058f |
111100102031 has 8 divisors (see below), whose sum is σ = 112004505600. Its totient is φ = 110196161208.
The previous prime is 111100102013. The next prime is 111100102039. The reversal of 111100102031 is 130201001111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111100102031 - 214 = 111100085647 is a prime.
It is a super-2 number, since 2×1111001020312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111100102039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 374870 + ... + 602268.
It is an arithmetic number, because the mean of its divisors is an integer number (14000563200).
Almost surely, 2111100102031 is an apocalyptic number.
111100102031 is a deficient number, since it is larger than the sum of its proper divisors (904403569).
111100102031 is a wasteful number, since it uses less digits than its factorization.
111100102031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231373.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 111100102031 its reverse (130201001111), we get a palindrome (241301103142).
The spelling of 111100102031 in words is "one hundred eleven billion, one hundred million, one hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •