Base | Representation |
---|---|
bin | 10001111011101… |
… | …00110101000000 |
3 | 101111001101011110 |
4 | 20331310311000 |
5 | 302002044041 |
6 | 22532043320 |
7 | 3504406356 |
oct | 1075646500 |
9 | 344041143 |
10 | 150424896 |
11 | 77a024a6 |
12 | 42463540 |
13 | 2521a41b |
14 | 15d997d6 |
15 | d315516 |
hex | 8f74d40 |
150424896 has 112 divisors (see below), whose sum is σ = 416153600. Its totient is φ = 47900160.
The previous prime is 150424889. The next prime is 150424913. The reversal of 150424896 is 698424051.
It is a super-2 number, since 2×1504248962 = 45255298673221632, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 755805 + ... + 756003.
Almost surely, 2150424896 is an apocalyptic number.
150424896 is a gapful number since it is divisible by the number (16) 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 150424896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (208076800).
150424896 is an abundant number, since it is smaller than the sum of its proper divisors (265728704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150424896 is a wasteful number, since it uses less digits than its factorization.
150424896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372 (or 362 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 39.
The square root of 150424896 is about 12264.7827538852. The cubic root of 150424896 is about 531.8304998296.
The spelling of 150424896 in words is "one hundred fifty million, four hundred twenty-four thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •