Base | Representation |
---|---|
bin | 1000100110100011101… |
… | …1111101000101000000 |
3 | 112010110200220012001012 |
4 | 2021220323331011000 |
5 | 4410133043411300 |
6 | 151521000300052 |
7 | 13451234320631 |
oct | 2115073750500 |
9 | 463420805035 |
10 | 147789435200 |
11 | 5774a3130a0 |
12 | 24786471628 |
13 | 10c235bc154 |
14 | 721dd63888 |
15 | 3c9e9c7435 |
hex | 2268efd140 |
147789435200 has 168 divisors, whose sum is σ = 397585472544. Its totient is φ = 53623552000.
The previous prime is 147789435163. The next prime is 147789435221. The reversal of 147789435200 is 2534987741.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8210210 + ... + 8228190.
Almost surely, 2147789435200 is an apocalyptic number.
147789435200 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 147789435200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (198792736272).
147789435200 is an abundant number, since it is smaller than the sum of its proper divisors (249796037344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147789435200 is a wasteful number, since it uses less digits than its factorization.
147789435200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18481 (or 18466 counting only the distinct ones).
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 147789435200 in words is "one hundred forty-seven billion, seven hundred eighty-nine million, four hundred thirty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •