Base | Representation |
---|---|
bin | 10010011110110… |
… | …01101101010000 |
3 | 101210201110110202 |
4 | 21033121231100 |
5 | 304142014100 |
6 | 23214514332 |
7 | 3561516335 |
oct | 1117315520 |
9 | 353643422 |
10 | 155032400 |
11 | 7a56a156 |
12 | 43b059a8 |
13 | 26171663 |
14 | 1683898c |
15 | d9257d5 |
hex | 93d9b50 |
155032400 has 60 divisors (see below), whose sum is σ = 392088000. Its totient is φ = 58746240.
The previous prime is 155032391. The next prime is 155032403. The reversal of 155032400 is 4230551.
155032400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155032403) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2600 + ... + 17799.
It is an arithmetic number, because the mean of its divisors is an integer number (6534800).
Almost surely, 2155032400 is an apocalyptic number.
155032400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
155032400 is an abundant number, since it is smaller than the sum of its proper divisors (237055600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155032400 is a wasteful number, since it uses less digits than its factorization.
155032400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20436 (or 20425 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 20.
The square root of 155032400 is about 12451.2007453097. The cubic root of 155032400 is about 537.2059614042.
Adding to 155032400 its reverse (4230551), we get a palindrome (159262951).
The spelling of 155032400 in words is "one hundred fifty-five million, thirty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •