Base | Representation |
---|---|
bin | 110100001010010010… |
… | …1000010001000110100 |
3 | 101201010110212012120021 |
4 | 1220110211002020310 |
5 | 3313401141331400 |
6 | 123243025214524 |
7 | 11043551464606 |
oct | 1502445021064 |
9 | 351113765507 |
10 | 112014402100 |
11 | 43561234237 |
12 | 19861491444 |
13 | a741947703 |
14 | 55c894b176 |
15 | 2da8da271a |
hex | 1a14942234 |
112014402100 has 36 divisors (see below), whose sum is σ = 244414227148. Its totient is φ = 44558208000.
The previous prime is 112014401981. The next prime is 112014402103. The reversal of 112014402100 is 1204410211.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 39860921104 + 72153480996 = 199652^2 + 268614^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112014402103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3076221 + ... + 3112420.
Almost surely, 2112014402100 is an apocalyptic number.
112014402100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112014402100 is an abundant number, since it is smaller than the sum of its proper divisors (132399825048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112014402100 is a wasteful number, since it uses less digits than its factorization.
112014402100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6188836 (or 6188829 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 112014402100 its reverse (1204410211), we get a palindrome (113218812311).
The spelling of 112014402100 in words is "one hundred twelve billion, fourteen million, four hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •