Base | Representation |
---|---|
bin | 1101010111100… |
… | …00010101111110 |
3 | 21210222222020200 |
4 | 12223300111332 |
5 | 212201233002 |
6 | 15043224330 |
7 | 2531055555 |
oct | 653602576 |
9 | 253888220 |
10 | 112133502 |
11 | 58329618 |
12 | 316780a6 |
13 | 1a3014b0 |
14 | 10c6cd9c |
15 | 9c9eb1c |
hex | 6af057e |
112133502 has 48 divisors (see below), whose sum is σ = 262652208. Its totient is φ = 34369920.
The previous prime is 112133501. The next prime is 112133509. The reversal of 112133502 is 205331211.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112133501) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 72477 + ... + 74007.
It is an arithmetic number, because the mean of its divisors is an integer number (5471921).
Almost surely, 2112133502 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112133502, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131326104).
112133502 is an abundant number, since it is smaller than the sum of its proper divisors (150518706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112133502 is a wasteful number, since it uses less digits than its factorization.
112133502 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1865 (or 1862 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 112133502 is about 10589.3107424421. The cubic root of 112133502 is about 482.2198998907.
Adding to 112133502 its reverse (205331211), we get a palindrome (317464713).
The spelling of 112133502 in words is "one hundred twelve million, one hundred thirty-three thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •