Base | Representation |
---|---|
bin | 110100001010001110… |
… | …0010000000111000000 |
3 | 101201010022112020201111 |
4 | 1220110130100013000 |
5 | 3313400044200112 |
6 | 123242504013104 |
7 | 11043523066210 |
oct | 1502434200700 |
9 | 351108466644 |
10 | 112012100032 |
11 | 4355aa016a8 |
12 | 19860761194 |
13 | a74131c941 |
14 | 55c850c240 |
15 | 2da8a9a5a7 |
hex | 1a147101c0 |
112012100032 has 112 divisors (see below), whose sum is σ = 263941560000. Its totient is φ = 46146207744.
The previous prime is 112012100021. The next prime is 112012100033. The reversal of 112012100032 is 230001210211.
It is a tau number, because it is divible by the number of its divisors (112).
It is a junction number, because it is equal to n+sod(n) for n = 112012099985 and 112012100021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112012100033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2956344 + ... + 2993992.
Almost surely, 2112012100032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112012100032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131970780000).
112012100032 is an abundant number, since it is smaller than the sum of its proper divisors (151929459968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112012100032 is a wasteful number, since it uses less digits than its factorization.
112012100032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37926 (or 37916 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 112012100032 its reverse (230001210211), we get a palindrome (342013310243).
The spelling of 112012100032 in words is "one hundred twelve billion, twelve million, one hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •