Base | Representation |
---|---|
bin | 10001010111000… |
… | …00111110101000 |
3 | 101011000111221112 |
4 | 20223200332220 |
5 | 244240000000 |
6 | 22241125452 |
7 | 3415535453 |
oct | 1053407650 |
9 | 334014845 |
10 | 145625000 |
11 | 75224244 |
12 | 40929888 |
13 | 24229751 |
14 | 154aa49a |
15 | cbb8235 |
hex | 8ae0fa8 |
145625000 has 64 divisors (see below), whose sum is σ = 342772560. Its totient is φ = 58000000.
The previous prime is 145624951. The next prime is 145625023. The reversal of 145625000 is 526541.
It can be written as a sum of positive squares in 8 ways, for example, as 143185156 + 2439844 = 11966^2 + 1562^2 .
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, 624884 + ... + 625116.
Almost surely, 2145625000 is an apocalyptic number.
145625000 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 145625000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171386280).
145625000 is an abundant number, since it is smaller than the sum of its proper divisors (197147560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145625000 is an frugal number, since it uses more digits than its factorization.
145625000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274 (or 240 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 145625000 is about 12067.5183861472. The cubic root of 145625000 is about 526.1125311627.
The spelling of 145625000 in words is "one hundred forty-five million, six hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •