Base | Representation |
---|---|
bin | 1000101001000100111… |
… | …1001111100111000000 |
3 | 112012012211011220222222 |
4 | 2022101033033213000 |
5 | 4413024142033410 |
6 | 152112032350212 |
7 | 13504054416650 |
oct | 2122117174700 |
9 | 465184156888 |
10 | 148465580480 |
11 | 57a66a4a048 |
12 | 249349a5368 |
13 | 110006c8709 |
14 | 7285a8c360 |
15 | 3cde036955 |
hex | 22913cf9c0 |
148465580480 has 448 divisors, whose sum is σ = 453536547840. Its totient is φ = 45063143424.
The previous prime is 148465580477. The next prime is 148465580503. The reversal of 148465580480 is 84085564841.
It is a tau number, because it is divible by the number of its divisors (448).
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 63 ways as a sum of consecutive naturals, for example, 113591987 + ... + 113593293.
Almost surely, 2148465580480 is an apocalyptic number.
148465580480 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 148465580480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (226768273920).
148465580480 is an abundant number, since it is smaller than the sum of its proper divisors (305070967360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148465580480 is a wasteful number, since it uses less digits than its factorization.
148465580480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1524 (or 1514 counting only the distinct ones).
The product of its (nonzero) digits is 4915200, while the sum is 53.
The spelling of 148465580480 in words is "one hundred forty-eight billion, four hundred sixty-five million, five hundred eighty thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •