Base | Representation |
---|---|
bin | 110100001010001100… |
… | …0000011101000001100 |
3 | 101201010020110101012212 |
4 | 1220110120003220030 |
5 | 3313344304002312 |
6 | 123242424245552 |
7 | 11043510536120 |
oct | 1502430035014 |
9 | 351106411185 |
10 | 112011000332 |
11 | 4355a320460 |
12 | 198603108b8 |
13 | a74102622a |
14 | 55c8303580 |
15 | 2da892e822 |
hex | 1a14603a0c |
112011000332 has 24 divisors (see below), whose sum is σ = 244387637760. Its totient is φ = 43640649360.
The previous prime is 112011000287. The next prime is 112011000337. The reversal of 112011000332 is 233000110211.
It is a super-2 number, since 2×1120110003322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (112011000337) 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 7 ways as a sum of consecutive naturals, for example, 181835732 + ... + 181836347.
It is an arithmetic number, because the mean of its divisors is an integer number (10182818240).
Almost surely, 2112011000332 is an apocalyptic number.
It is an amenable number.
112011000332 is an abundant number, since it is smaller than the sum of its proper divisors (132376637428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112011000332 is a wasteful number, since it uses less digits than its factorization.
112011000332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363672101 (or 363672099 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 112011000332 its reverse (233000110211), we get a palindrome (345011110543).
The spelling of 112011000332 in words is "one hundred twelve billion, eleven million, three hundred thirty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •