Base | Representation |
---|---|
bin | 10010000111010… |
… | …00110101000000 |
3 | 101120220210022020 |
4 | 21003220311000 |
5 | 302344323413 |
6 | 23024441440 |
7 | 3523353600 |
oct | 1103506500 |
9 | 346823266 |
10 | 151948608 |
11 | 78853269 |
12 | 42a79280 |
13 | 25631b26 |
14 | 16274c00 |
15 | d516c23 |
hex | 90e8d40 |
151948608 has 168 divisors, whose sum is σ = 483681024. Its totient is φ = 41932800.
The previous prime is 151948607. The next prime is 151948613. The reversal of 151948608 is 806849151.
It is a tau number, because it is divible by the number of its divisors (168).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 151948608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151948607) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 291388 + ... + 291908.
Almost surely, 2151948608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 151948608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (241840512).
151948608 is an abundant number, since it is smaller than the sum of its proper divisors (331732416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151948608 is a wasteful number, since it uses less digits than its factorization.
151948608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 581 (or 564 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 42.
The square root of 151948608 is about 12326.7436089180. The cubic root of 151948608 is about 533.6201762550.
The spelling of 151948608 in words is "one hundred fifty-one million, nine hundred forty-eight thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •