Base | Representation |
---|---|
bin | 10001100011011… |
… | …00010000100000 |
3 | 101021001202212212 |
4 | 20301230100200 |
5 | 300143302224 |
6 | 22335541252 |
7 | 3435360662 |
oct | 1061542040 |
9 | 337052785 |
10 | 147244064 |
11 | 7612a710 |
12 | 4138a828 |
13 | 24675686 |
14 | 157ac532 |
15 | cdd7d0e |
hex | 8c6c420 |
147244064 has 48 divisors (see below), whose sum is σ = 317229696. Its totient is φ = 66720000.
The previous prime is 147244063. The next prime is 147244081. The reversal of 147244064 is 460442741.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 147244064.
It is not an unprimeable number, because it can be changed into a prime (147244061) 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, 195689 + ... + 196439.
It is an arithmetic number, because the mean of its divisors is an integer number (6608952).
Almost surely, 2147244064 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 147244064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158614848).
147244064 is an abundant number, since it is smaller than the sum of its proper divisors (169985632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147244064 is a wasteful number, since it uses less digits than its factorization.
147244064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1329 (or 1321 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 32.
The square root of 147244064 is about 12134.4165084276. The cubic root of 147244064 is about 528.0551289239.
The spelling of 147244064 in words is "one hundred forty-seven million, two hundred forty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •