Base | Representation |
---|---|
bin | 110100001010110100… |
… | …0100011001010100111 |
3 | 101201011201011101221020 |
4 | 1220111220203022213 |
5 | 3313420204213111 |
6 | 123244500422223 |
7 | 11044155101154 |
oct | 1502550431247 |
9 | 351151141836 |
10 | 112032101031 |
11 | 43570222754 |
12 | 198673a7973 |
13 | a745503656 |
14 | 55cb03722b |
15 | 2daa6eb906 |
hex | 1a15a232a7 |
112032101031 has 16 divisors (see below), whose sum is σ = 152736230880. Its totient is φ = 73018050560.
The previous prime is 112032101009. The next prime is 112032101059. The reversal of 112032101031 is 130101230211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 112032101031 - 230 = 110958359207 is a prime.
It is a super-2 number, since 2×1120321010312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112032101031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112032101231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1209066 + ... + 1298423.
It is an arithmetic number, because the mean of its divisors is an integer number (9546014430).
Almost surely, 2112032101031 is an apocalyptic number.
112032101031 is a deficient number, since it is larger than the sum of its proper divisors (40704129849).
112032101031 is a wasteful number, since it uses less digits than its factorization.
112032101031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2507826.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 112032101031 its reverse (130101230211), we get a palindrome (242133331242).
The spelling of 112032101031 in words is "one hundred twelve billion, thirty-two million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •