Base | Representation |
---|---|
bin | 10001010010101… |
… | …00111001000000 |
3 | 101002221100211200 |
4 | 20221110321000 |
5 | 244113114300 |
6 | 22220541200 |
7 | 3410625540 |
oct | 1051247100 |
9 | 332840750 |
10 | 145051200 |
11 | 74972128 |
12 | 406b1800 |
13 | 24088518 |
14 | 1539b320 |
15 | cb03200 |
hex | 8a54e40 |
145051200 has 252 divisors, whose sum is σ = 589605120. Its totient is φ = 33131520.
The previous prime is 145051199. The next prime is 145051213. The reversal of 145051200 is 2150541.
It is a tau number, because it is divible by the number of its divisors (252).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 100081 + ... + 101519.
Almost surely, 2145051200 is an apocalyptic number.
145051200 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 145051200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (294802560).
145051200 is an abundant number, since it is smaller than the sum of its proper divisors (444553920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145051200 is a wasteful number, since it uses less digits than its factorization.
145051200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1474 (or 1456 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
The square root of 145051200 is about 12043.7203554383. The cubic root of 145051200 is about 525.4206153057.
It can be divided in two parts, 1450 and 51200, that added together give a triangular number (52650 = T324).
The spelling of 145051200 in words is "one hundred forty-five million, fifty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •