Base | Representation |
---|---|
bin | 10001010110011… |
… | …10110011010110 |
3 | 101010212201211010 |
4 | 20223032303112 |
5 | 244230104200 |
6 | 22235353050 |
7 | 3415105425 |
oct | 1053166326 |
9 | 333781733 |
10 | 145550550 |
11 | 75183312 |
12 | 408b2786 |
13 | 242018b2 |
14 | 1548b2bc |
15 | cba1150 |
hex | 8acecd6 |
145550550 has 48 divisors (see below), whose sum is σ = 362222352. Its totient is φ = 38678400.
The previous prime is 145550527. The next prime is 145550551. The reversal of 145550550 is 55055541.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145550551) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 46020 + ... + 49080.
It is an arithmetic number, because the mean of its divisors is an integer number (7546299).
Almost surely, 2145550550 is an apocalyptic number.
145550550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 145550550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181111176).
145550550 is an abundant number, since it is smaller than the sum of its proper divisors (216671802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145550550 is a wasteful number, since it uses less digits than its factorization.
145550550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3393 (or 3388 counting only the distinct ones).
The product of its (nonzero) digits is 12500, while the sum is 30.
The square root of 145550550 is about 12064.4332647663. The cubic root of 145550550 is about 526.0228584764.
The spelling of 145550550 in words is "one hundred forty-five million, five hundred fifty thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •