Base | Representation |
---|---|
bin | 10001111001100… |
… | …10101101001000 |
3 | 101110112121122100 |
4 | 20330302231020 |
5 | 301414412211 |
6 | 22522153400 |
7 | 3502200633 |
oct | 1074625510 |
9 | 343477570 |
10 | 150154056 |
11 | 77837a68 |
12 | 42352860 |
13 | 25154070 |
14 | 15d28c1a |
15 | d2b0156 |
hex | 8f32b48 |
150154056 has 96 divisors (see below), whose sum is σ = 445536000. Its totient is φ = 45401472.
The previous prime is 150154027. The next prime is 150154087. The reversal of 150154056 is 650451051.
It is a happy number.
It is a super-2 number, since 2×1501540562 = 45092481066502272, 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 23 ways as a sum of consecutive naturals, for example, 53865 + ... + 56583.
It is an arithmetic number, because the mean of its divisors is an integer number (4641000).
Almost surely, 2150154056 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 150154056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222768000).
150154056 is an abundant number, since it is smaller than the sum of its proper divisors (295381944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150154056 is a wasteful number, since it uses less digits than its factorization.
150154056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2803 (or 2796 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
The square root of 150154056 is about 12253.7364097650. The cubic root of 150154056 is about 531.5111211638.
The spelling of 150154056 in words is "one hundred fifty million, one hundred fifty-four thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •