Base | Representation |
---|---|
bin | 1101100010111… |
… | …10000000000000 |
3 | 21220211001202011 |
4 | 12301132000000 |
5 | 213042144412 |
6 | 15135302304 |
7 | 2546564251 |
oct | 661360000 |
9 | 256731664 |
10 | 113631232 |
11 | 59161910 |
12 | 3207a994 |
13 | 1a707120 |
14 | 1113cb28 |
15 | 9e987a7 |
hex | 6c5e000 |
113631232 has 112 divisors (see below), whose sum is σ = 269729712. Its totient is φ = 47185920.
The previous prime is 113631209. The next prime is 113631239. The reversal of 113631232 is 232136311.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113631239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1171408 + ... + 1171504.
It is an arithmetic number, because the mean of its divisors is an integer number (2408301).
Almost surely, 2113631232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113631232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134864856).
113631232 is an abundant number, since it is smaller than the sum of its proper divisors (156098480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113631232 is an equidigital number, since it uses as much as digits as its factorization.
113631232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147 (or 123 counting only the distinct ones).
The product of its digits is 648, while the sum is 22.
The square root of 113631232 is about 10659.7951199824. The cubic root of 113631232 is about 484.3573619217.
Adding to 113631232 its reverse (232136311), we get a palindrome (345767543).
The spelling of 113631232 in words is "one hundred thirteen million, six hundred thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •