Base | Representation |
---|---|
bin | 1000011110101000110… |
… | …0001111000000000000 |
3 | 111220222111121220111120 |
4 | 2013222030033000000 |
5 | 4341304211341410 |
6 | 150525555312240 |
7 | 13344444020061 |
oct | 2075214170000 |
9 | 456874556446 |
10 | 145662996480 |
11 | 56858a67221 |
12 | 242922ab680 |
13 | 10974ba52a1 |
14 | 709b794568 |
15 | 3bc7e8b570 |
hex | 21ea30f000 |
145662996480 has 208 divisors, whose sum is σ = 486333089280. Its totient is φ = 37154258944.
The previous prime is 145662996439. The next prime is 145662996497. The reversal of 145662996480 is 84699266541.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1361581 + ... + 1464659.
Almost surely, 2145662996480 is an apocalyptic number.
145662996480 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 145662996480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (243166544640).
145662996480 is an abundant number, since it is smaller than the sum of its proper divisors (340670092800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145662996480 is a wasteful number, since it uses less digits than its factorization.
145662996480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103134 (or 103112 counting only the distinct ones).
The product of its (nonzero) digits is 22394880, while the sum is 60.
The spelling of 145662996480 in words is "one hundred forty-five billion, six hundred sixty-two million, nine hundred ninety-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •