Base | Representation |
---|---|
bin | 1000011101100000011… |
… | …1110100010111100000 |
3 | 111220012101012102020110 |
4 | 2013120013310113200 |
5 | 4340144110131203 |
6 | 150435530011320 |
7 | 13334103221010 |
oct | 2073007642740 |
9 | 456171172213 |
10 | 145359848928 |
11 | 56712932a58 |
12 | 24208876b40 |
13 | 10927144938 |
14 | 706d401c40 |
15 | 3bab559d03 |
hex | 21d81f45e0 |
145359848928 has 192 divisors, whose sum is σ = 445058385408. Its totient is φ = 40683202560.
The previous prime is 145359848917. The next prime is 145359848947. The reversal of 145359848928 is 829848953541.
It is a super-2 number, since 2×1453598489282 (a number of 23 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 8140426 + ... + 8158262.
It is an arithmetic number, because the mean of its divisors is an integer number (2318012424).
Almost surely, 2145359848928 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 145359848928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222529192704).
145359848928 is an abundant number, since it is smaller than the sum of its proper divisors (299698536480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145359848928 is a wasteful number, since it uses less digits than its factorization.
145359848928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18105 (or 18097 counting only the distinct ones).
The product of its digits is 99532800, while the sum is 66.
The spelling of 145359848928 in words is "one hundred forty-five billion, three hundred fifty-nine million, eight hundred forty-eight thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •