Base | Representation |
---|---|
bin | 110011110010111010… |
… | …1001101000100011111 |
3 | 101122002211002010211221 |
4 | 1213211311031010133 |
5 | 3310244402041111 |
6 | 123033131154211 |
7 | 11015246231623 |
oct | 1474565150437 |
9 | 348084063757 |
10 | 111230112031 |
11 | 43199553525 |
12 | 196828a5967 |
13 | a64830534c |
14 | 5552711183 |
15 | 2d600d0371 |
hex | 19e5d4d11f |
111230112031 has 8 divisors (see below), whose sum is σ = 112029984000. Its totient is φ = 110430951840.
The previous prime is 111230111983. The next prime is 111230112041. The reversal of 111230112031 is 130211032111.
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 111230112031 - 217 = 111229980959 is a prime.
It is a super-2 number, since 2×1112301120312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111230111996 and 111230112014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111230112041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137725 + ... + 491353.
It is an arithmetic number, because the mean of its divisors is an integer number (14003748000).
Almost surely, 2111230112031 is an apocalyptic number.
111230112031 is a deficient number, since it is larger than the sum of its proper divisors (799871969).
111230112031 is a wasteful number, since it uses less digits than its factorization.
111230112031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355889.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 111230112031 its reverse (130211032111), we get a palindrome (241441144142).
The spelling of 111230112031 in words is "one hundred eleven billion, two hundred thirty million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •