Base | Representation |
---|---|
bin | 110100010000110001… |
… | …1001001100011111111 |
3 | 101201200122022221021100 |
4 | 1220201203021203333 |
5 | 3314322343341111 |
6 | 123320401304143 |
7 | 11052133235106 |
oct | 1504143114377 |
9 | 351618287240 |
10 | 112232012031 |
11 | 43663054857 |
12 | 19902335053 |
13 | a777a59299 |
14 | 56097d503d |
15 | 2dbd039756 |
hex | 1a218c98ff |
112232012031 has 24 divisors (see below), whose sum is σ = 169182314496. Its totient is φ = 71559346320.
The previous prime is 112232012017. The next prime is 112232012041. The reversal of 112232012031 is 130210232211.
It is not a de Polignac number, because 112232012031 - 26 = 112232011967 is a prime.
It is a super-2 number, since 2×1122320120312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112232011995 and 112232012013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112232012041) 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 23 ways as a sum of consecutive naturals, for example, 1904986 + ... + 1963016.
It is an arithmetic number, because the mean of its divisors is an integer number (7049263104).
Almost surely, 2112232012031 is an apocalyptic number.
112232012031 is a deficient number, since it is larger than the sum of its proper divisors (56950302465).
112232012031 is a wasteful number, since it uses less digits than its factorization.
112232012031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67403 (or 67400 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 112232012031 its reverse (130210232211), we get a palindrome (242442244242).
The spelling of 112232012031 in words is "one hundred twelve billion, two hundred thirty-two million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •