Base | Representation |
---|---|
bin | 10001010010101… |
… | …01010111000000 |
3 | 101002221110110210 |
4 | 20221111113000 |
5 | 244113144440 |
6 | 22220554120 |
7 | 3410634252 |
oct | 1051252700 |
9 | 332843423 |
10 | 145053120 |
11 | 74973613 |
12 | 406b2940 |
13 | 24089364 |
14 | 1539bcd2 |
15 | cb03a80 |
hex | 8a555c0 |
145053120 has 112 divisors (see below), whose sum is σ = 468282528. Its totient is φ = 38031360.
The previous prime is 145053119. The next prime is 145053193. The reversal of 145053120 is 21350541.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57322 + ... + 59798.
It is an arithmetic number, because the mean of its divisors is an integer number (4181094).
Almost surely, 2145053120 is an apocalyptic number.
145053120 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 145053120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234141264).
145053120 is an abundant number, since it is smaller than the sum of its proper divisors (323229408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145053120 is a wasteful number, since it uses less digits than its factorization.
145053120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2558 (or 2548 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 145053120 is about 12043.8000647636. The cubic root of 145053120 is about 525.4229335748.
The spelling of 145053120 in words is "one hundred forty-five million, fifty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.421 sec. • engine limits •