Base | Representation |
---|---|
bin | 1000100100111100010… |
… | …0101011111010010000 |
3 | 112002100110101211120110 |
4 | 2021033010223322100 |
5 | 4403241003012220 |
6 | 151405540041320 |
7 | 13434415140000 |
oct | 2111704537220 |
9 | 462313354513 |
10 | 147355516560 |
11 | 5754739064a |
12 | 24685093240 |
13 | 10b84733065 |
14 | 71bc490000 |
15 | 3c76863be0 |
hex | 224f12be90 |
147355516560 has 800 divisors, whose sum is σ = 562564850688. Its totient is φ = 31863767040.
The previous prime is 147355516513. The next prime is 147355516577. The reversal of 147355516560 is 65615553741.
It is a Harshad number since it is a multiple of its sum of digits (48).
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 159 ways as a sum of consecutive naturals, for example, 1304031064 + ... + 1304031176.
Almost surely, 2147355516560 is an apocalyptic number.
147355516560 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 147355516560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (281282425344).
147355516560 is an abundant number, since it is smaller than the sum of its proper divisors (415209334128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147355516560 is a wasteful number, since it uses less digits than its factorization.
147355516560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261 (or 234 counting only the distinct ones).
The product of its (nonzero) digits is 1890000, while the sum is 48.
The spelling of 147355516560 in words is "one hundred forty-seven billion, three hundred fifty-five million, five hundred sixteen thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •