Base | Representation |
---|---|
bin | 10001010010101… |
… | …00100110010000 |
3 | 101002221022012020 |
4 | 20221110212100 |
5 | 244113100000 |
6 | 22220531440 |
7 | 3410622204 |
oct | 1051244620 |
9 | 332838166 |
10 | 145050000 |
11 | 74971237 |
12 | 406b0b80 |
13 | 24087b04 |
14 | 1539ab04 |
15 | cb02ba0 |
hex | 8a54990 |
145050000 has 120 divisors (see below), whose sum is σ = 468844992. Its totient is φ = 38640000.
The previous prime is 145049987. The next prime is 145050013. The reversal of 145050000 is 50541.
It is an interprime number because it is at equal distance from previous prime (145049987) and next prime (145050013).
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 149517 + ... + 150483.
Almost surely, 2145050000 is an apocalyptic number.
145050000 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 145050000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234422496).
145050000 is an abundant number, since it is smaller than the sum of its proper divisors (323794992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145050000 is an frugal number, since it uses more digits than its factorization.
145050000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1003 (or 977 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 15.
The square root of 145050000 is about 12043.6705368422. The cubic root of 145050000 is about 525.4191663772.
The spelling of 145050000 in words is "one hundred forty-five million, fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •