Base | Representation |
---|---|
bin | 10010011110110… |
… | …01101000010000 |
3 | 101210201110000220 |
4 | 21033121220100 |
5 | 304142011310 |
6 | 23214513040 |
7 | 3561515400 |
oct | 1117315020 |
9 | 353643026 |
10 | 155032080 |
11 | 7a569995 |
12 | 43b05780 |
13 | 26171478 |
14 | 16838800 |
15 | d925670 |
hex | 93d9a10 |
155032080 has 120 divisors (see below), whose sum is σ = 559107072. Its totient is φ = 35433216.
The previous prime is 155032043. The next prime is 155032091. The reversal of 155032080 is 80230551.
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 (24).
It is a self number, because there is not a number n which added to its sum of digits gives 155032080.
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, 5169 + ... + 18351.
Almost surely, 2155032080 is an apocalyptic number.
155032080 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 155032080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (279553536).
155032080 is an abundant number, since it is smaller than the sum of its proper divisors (404074992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155032080 is a wasteful number, since it uses less digits than its factorization.
155032080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13213 (or 13200 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 155032080 is about 12451.1878951368. The cubic root of 155032080 is about 537.2055917911.
The spelling of 155032080 in words is "one hundred fifty-five million, thirty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •