Base | Representation |
---|---|
bin | 10010000101000… |
… | …01001100100000 |
3 | 101120100212211021 |
4 | 21002201030200 |
5 | 302310431300 |
6 | 23014255224 |
7 | 3521022304 |
oct | 1102411440 |
9 | 346325737 |
10 | 151655200 |
11 | 78672884 |
12 | 42957514 |
13 | 2555b408 |
14 | 161d9d04 |
15 | d4a9d1a |
hex | 90a1320 |
151655200 has 72 divisors (see below), whose sum is σ = 372819888. Its totient is φ = 60238080.
The previous prime is 151655197. The next prime is 151655201. The reversal of 151655200 is 2556151.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (151655201) 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, 129819 + ... + 130981.
It is an arithmetic number, because the mean of its divisors is an integer number (5178054).
Almost surely, 2151655200 is an apocalyptic number.
151655200 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 151655200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186409944).
151655200 is an abundant number, since it is smaller than the sum of its proper divisors (221164688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151655200 is a wasteful number, since it uses less digits than its factorization.
151655200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1346 (or 1333 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The square root of 151655200 is about 12314.8365803205. The cubic root of 151655200 is about 533.2764869967.
The spelling of 151655200 in words is "one hundred fifty-one million, six hundred fifty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •