Base | Representation |
---|---|
bin | 10001010110100… |
… | …01110010011100 |
3 | 101010220100121002 |
4 | 20223101302130 |
5 | 244231002110 |
6 | 22235525432 |
7 | 3415156166 |
oct | 1053216234 |
9 | 333810532 |
10 | 145562780 |
11 | 75191520 |
12 | 408b9878 |
13 | 2420732c |
14 | 15491936 |
15 | cba4aa5 |
hex | 8ad1c9c |
145562780 has 48 divisors (see below), whose sum is σ = 338204160. Its totient is φ = 52180800.
The previous prime is 145562779. The next prime is 145562821. The reversal of 145562780 is 87265541.
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, 10961 + ... + 20279.
It is an arithmetic number, because the mean of its divisors is an integer number (7045920).
Almost surely, 2145562780 is an apocalyptic number.
145562780 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 145562780, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169102080).
145562780 is an abundant number, since it is smaller than the sum of its proper divisors (192641380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145562780 is a wasteful number, since it uses less digits than its factorization.
145562780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9410 (or 9408 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 38.
The square root of 145562780 is about 12064.9401158895. The cubic root of 145562780 is about 526.0375912259.
The spelling of 145562780 in words is "one hundred forty-five million, five hundred sixty-two thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •