Base | Representation |
---|---|
bin | 10010100010011… |
… | …01000101101000 |
3 | 101211121110202110 |
4 | 21101031011220 |
5 | 304302130000 |
6 | 23233002320 |
7 | 3565525230 |
oct | 1121150550 |
9 | 354543673 |
10 | 155505000 |
11 | 7a862232 |
12 | 440b33a0 |
13 | 262a87c1 |
14 | 1691ccc0 |
15 | d9ba850 |
hex | 944d168 |
155505000 has 160 divisors (see below), whose sum is σ = 555572160. Its totient is φ = 35520000.
The previous prime is 155504957. The next prime is 155505011. The reversal of 155505000 is 505551.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 39 ways as a sum of consecutive naturals, for example, 104260 + ... + 105740.
It is an arithmetic number, because the mean of its divisors is an integer number (3472326).
Almost surely, 2155505000 is an apocalyptic number.
155505000 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 155505000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (277786080).
155505000 is an abundant number, since it is smaller than the sum of its proper divisors (400067160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155505000 is a wasteful number, since it uses less digits than its factorization.
155505000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1517 (or 1498 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 21.
The square root of 155505000 is about 12470.1643934633. The cubic root of 155505000 is about 537.7512796608.
The spelling of 155505000 in words is "one hundred fifty-five million, five hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •