Base | Representation |
---|---|
bin | 10001111011110… |
… | …11101011011000 |
3 | 101111002210122120 |
4 | 20331323223120 |
5 | 302003443302 |
6 | 22532421240 |
7 | 3504554226 |
oct | 1075735330 |
9 | 344083576 |
10 | 150452952 |
11 | 77a21591 |
12 | 42477820 |
13 | 2522a120 |
14 | 15da5b16 |
15 | d31d9bc |
hex | 8f7bad8 |
150452952 has 64 divisors (see below), whose sum is σ = 416045280. Its totient is φ = 45038592.
The previous prime is 150452947. The next prime is 150452977. The reversal of 150452952 is 259254051.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5028 + ... + 18060.
Almost surely, 2150452952 is an apocalyptic number.
150452952 is a gapful number since it is divisible by the number (12) 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 150452952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (208022640).
150452952 is an abundant number, since it is smaller than the sum of its proper divisors (265592328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150452952 is a wasteful number, since it uses less digits than its factorization.
150452952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13092 (or 13088 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 33.
The square root of 150452952 is about 12265.9264631743. The cubic root of 150452952 is about 531.8635619741.
The spelling of 150452952 in words is "one hundred fifty million, four hundred fifty-two thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •