Base | Representation |
---|---|
bin | 10001100011111… |
… | …00110110000000 |
3 | 101021012020002000 |
4 | 20301330312000 |
5 | 300202441000 |
6 | 22341224000 |
7 | 3436063023 |
oct | 1061746600 |
9 | 337166060 |
10 | 147312000 |
11 | 76176760 |
12 | 41402000 |
13 | 2469a584 |
14 | 157c91ba |
15 | cded000 |
hex | 8c7cd80 |
147312000 has 512 divisors, whose sum is σ = 611020800. Its totient is φ = 34560000.
The previous prime is 147311981. The next prime is 147312013. The reversal of 147312000 is 213741.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4751985 + ... + 4752015.
It is an arithmetic number, because the mean of its divisors is an integer number (1193400).
Almost surely, 2147312000 is an apocalyptic number.
147312000 is a gapful number since it is divisible by the number (10) 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 147312000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (305510400).
147312000 is an abundant number, since it is smaller than the sum of its proper divisors (463708800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147312000 is a wasteful number, since it uses less digits than its factorization.
147312000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80 (or 52 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 147312000 is about 12137.2154961507. The cubic root of 147312000 is about 528.1363284336.
Adding to 147312000 its reverse (213741), we get a palindrome (147525741).
The spelling of 147312000 in words is "one hundred forty-seven million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •