Base | Representation |
---|---|
bin | 110100001101110011… |
… | …0000100001101001110 |
3 | 101201102200100112212202 |
4 | 1220123212010031032 |
5 | 3314121310110410 |
6 | 123302432201502 |
7 | 11046511144004 |
oct | 1503346041516 |
9 | 351380315782 |
10 | 112132113230 |
11 | 43611722365 |
12 | 19894999292 |
13 | a76014c877 |
14 | 55da42ca74 |
15 | 2db43a4ca5 |
hex | 1a1b98434e |
112132113230 has 32 divisors (see below), whose sum is σ = 214082732160. Its totient is φ = 42167792160.
The previous prime is 112132113151. The next prime is 112132113251. The reversal of 112132113230 is 32311231211.
It is a happy number.
112132113230 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1121321132302 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 2227664 + ... + 2277443.
It is an arithmetic number, because the mean of its divisors is an integer number (6690085380).
Almost surely, 2112132113230 is an apocalyptic number.
112132113230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112132113230 is a deficient number, since it is larger than the sum of its proper divisors (101950618930).
112132113230 is a wasteful number, since it uses less digits than its factorization.
112132113230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4505264.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 112132113230 its reverse (32311231211), we get a palindrome (144443344441).
The spelling of 112132113230 in words is "one hundred twelve billion, one hundred thirty-two million, one hundred thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •