Base | Representation |
---|---|
bin | 1101011010100… |
… | …11110001010000 |
3 | 21211202122220000 |
4 | 12231103301100 |
5 | 212302301002 |
6 | 15100050000 |
7 | 2534403102 |
oct | 655236120 |
9 | 254678800 |
10 | 112540752 |
11 | 58587595 |
12 | 31833900 |
13 | 1a41497c |
14 | 10d37572 |
15 | 9d3061c |
hex | 6b53c50 |
112540752 has 50 divisors (see below), whose sum is σ = 325729338. Its totient is φ = 37513152.
The previous prime is 112540739. The next prime is 112540763. The reversal of 112540752 is 257045211.
112540752 is a `hidden beast` number, since 112 + 540 + 7 + 5 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 106007616 + 6533136 = 10296^2 + 2556^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 9 ways as a sum of consecutive naturals, for example, 42123 + ... + 44714.
Almost surely, 2112540752 is an apocalyptic number.
112540752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112540752 is an abundant number, since it is smaller than the sum of its proper divisors (213188586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112540752 is an equidigital number, since it uses as much as digits as its factorization.
112540752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86857 (or 86842 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 112540752 is about 10608.5226115610. The cubic root of 112540752 is about 482.8029750784.
Adding to 112540752 its reverse (257045211), we get a palindrome (369585963).
The spelling of 112540752 in words is "one hundred twelve million, five hundred forty thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •