Base | Representation |
---|---|
bin | 110100001110000100… |
… | …1000111010111110000 |
3 | 101201110022122100110010 |
4 | 1220130021013113300 |
5 | 3314131133114412 |
6 | 123303401134520 |
7 | 11046652222122 |
oct | 1503411072760 |
9 | 351408570403 |
10 | 112141301232 |
11 | 43616928454 |
12 | 19897a8a440 |
13 | a76201895c |
14 | 55db741212 |
15 | 2db50bc33c |
hex | 1a1c2475f0 |
112141301232 has 40 divisors (see below), whose sum is σ = 290573624320. Its totient is φ = 37267496640.
The previous prime is 112141301221. The next prime is 112141301333. The reversal of 112141301232 is 232103141211.
It is a junction number, because it is equal to n+sod(n) for n = 112141301199 and 112141301208.
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 7 ways as a sum of consecutive naturals, for example, 3513232 + ... + 3545007.
It is an arithmetic number, because the mean of its divisors is an integer number (7264340608).
Almost surely, 2112141301232 is an apocalyptic number.
112141301232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112141301232 is an abundant number, since it is smaller than the sum of its proper divisors (178432323088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112141301232 is a wasteful number, since it uses less digits than its factorization.
112141301232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7058581 (or 7058575 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 112141301232 its reverse (232103141211), we get a palindrome (344244442443).
The spelling of 112141301232 in words is "one hundred twelve billion, one hundred forty-one million, three hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •