Base | Representation |
---|---|
bin | 11011100010011… |
… | …01000000000000 |
3 | 121002200010022210 |
4 | 31301031000000 |
5 | 433114031422 |
6 | 34531102120 |
7 | 5503325355 |
oct | 1561150000 |
9 | 532603283 |
10 | 231002112 |
11 | 109438340 |
12 | 65441940 |
13 | 38b20453 |
14 | 2297262c |
15 | 1543010c |
hex | dc4d000 |
231002112 has 104 divisors (see below), whose sum is σ = 672317280. Its totient is φ = 69959680.
The previous prime is 231002071. The next prime is 231002113. The reversal of 231002112 is 211200132.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231002113) 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, 134314 + ... + 136022.
Almost surely, 2231002112 is an apocalyptic number.
231002112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 231002112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (336158640).
231002112 is an abundant number, since it is smaller than the sum of its proper divisors (441315168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231002112 is a wasteful number, since it uses less digits than its factorization.
231002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1747 (or 1725 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 231002112 is about 15198.7536331108. The cubic root of 231002112 is about 613.5811139163.
Adding to 231002112 its reverse (211200132), we get a palindrome (442202244).
The spelling of 231002112 in words is "two hundred thirty-one million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •