Base | Representation |
---|---|
bin | 10010100010011… |
… | …10001101100000 |
3 | 101211121201001211 |
4 | 21101032031200 |
5 | 304302301400 |
6 | 23233035504 |
7 | 3565544521 |
oct | 1121161540 |
9 | 354551054 |
10 | 155509600 |
11 | 7a865734 |
12 | 440b5b94 |
13 | 262aa91c |
14 | 16920848 |
15 | d9bbdba |
hex | 944e360 |
155509600 has 72 divisors (see below), whose sum is σ = 392787360. Its totient is φ = 60049920.
The previous prime is 155509573. The next prime is 155509639. The reversal of 155509600 is 6905551.
It is a happy number.
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 11 ways as a sum of consecutive naturals, for example, 19849 + ... + 26551.
It is an arithmetic number, because the mean of its divisors is an integer number (5455380).
Almost surely, 2155509600 is an apocalyptic number.
155509600 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 155509600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196393680).
155509600 is an abundant number, since it is smaller than the sum of its proper divisors (237277760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155509600 is a wasteful number, since it uses less digits than its factorization.
155509600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6752 (or 6739 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 31.
The square root of 155509600 is about 12470.3488323302. The cubic root of 155509600 is about 537.7565820230.
The spelling of 155509600 in words is "one hundred fifty-five million, five hundred nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •