Base | Representation |
---|---|
bin | 10001100010010… |
… | …01100110100000 |
3 | 101020210120011101 |
4 | 20301021212200 |
5 | 300124231422 |
6 | 22332524144 |
7 | 3434230063 |
oct | 1061114640 |
9 | 336716141 |
10 | 147102112 |
11 | 76042aa3 |
12 | 41320654 |
13 | 24625b91 |
14 | 157728da |
15 | cdaac27 |
hex | 8c499a0 |
147102112 has 48 divisors (see below), whose sum is σ = 303730560. Its totient is φ = 69997312.
The previous prime is 147102107. The next prime is 147102113. The reversal of 147102112 is 211201741.
It is a self number, because there is not a number n which added to its sum of digits gives 147102112.
It is not an unprimeable number, because it can be changed into a prime (147102113) 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, 197613 + ... + 198355.
It is an arithmetic number, because the mean of its divisors is an integer number (6327720).
Almost surely, 2147102112 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 147102112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151865280).
147102112 is an abundant number, since it is smaller than the sum of its proper divisors (156628448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147102112 is a wasteful number, since it uses less digits than its factorization.
147102112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1045 (or 1037 counting only the distinct ones).
The product of its (nonzero) digits is 112, while the sum is 19.
The square root of 147102112 is about 12128.5659498557. The cubic root of 147102112 is about 527.8853822220.
Adding to 147102112 its reverse (211201741), we get a palindrome (358303853).
The spelling of 147102112 in words is "one hundred forty-seven million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •