Base | Representation |
---|---|
bin | 10010001101000… |
… | …10001110111100 |
3 | 101122100101000220 |
4 | 21012202032330 |
5 | 303043124103 |
6 | 23053021340 |
7 | 3532665624 |
oct | 1106421674 |
9 | 348311026 |
10 | 152708028 |
11 | 79221890 |
12 | 43184850 |
13 | 258396a5 |
14 | 163d1884 |
15 | d616c53 |
hex | 91a23bc |
152708028 has 48 divisors (see below), whose sum is σ = 399229824. Its totient is φ = 45023040.
The previous prime is 152708021. The next prime is 152708033. The reversal of 152708028 is 820807251.
It is a super-3 number, since 3×1527080283 (a number of 26 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a self number, because there is not a number n which added to its sum of digits gives 152708028.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152708021) by changing a digit.
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, 10750 + ... + 20517.
It is an arithmetic number, because the mean of its divisors is an integer number (8317288).
Almost surely, 2152708028 is an apocalyptic number.
It is an amenable number.
152708028 is an abundant number, since it is smaller than the sum of its proper divisors (246521796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152708028 is a wasteful number, since it uses less digits than its factorization.
152708028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31322 (or 31320 counting only the distinct ones).
The product of its (nonzero) digits is 8960, while the sum is 33.
The square root of 152708028 is about 12357.5089722808. The cubic root of 152708028 is about 534.5076881404.
The spelling of 152708028 in words is "one hundred fifty-two million, seven hundred eight thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •