Base | Representation |
---|---|
bin | 10010001000000… |
… | …10111010011010 |
3 | 101121010012212100 |
4 | 21010002322122 |
5 | 302411233300 |
6 | 23031024230 |
7 | 3524310231 |
oct | 1104027232 |
9 | 347105770 |
10 | 152055450 |
11 | 78916568 |
12 | 42b0b076 |
13 | 2566b651 |
14 | 162a1b18 |
15 | d538700 |
hex | 9102e9a |
152055450 has 36 divisors (see below), whose sum is σ = 408523518. Its totient is φ = 40548000.
The previous prime is 152055443. The next prime is 152055457. The reversal of 152055450 is 54550251.
152055450 is a `hidden beast` number, since 1 + 5 + 205 + 5 + 450 = 666.
It is an interprime number because it is at equal distance from previous prime (152055443) and next prime (152055457).
It can be written as a sum of positive squares in 3 ways, for example, as 67617729 + 84437721 = 8223^2 + 9189^2 .
It is not an unprimeable number, because it can be changed into a prime (152055457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 168501 + ... + 169400.
Almost surely, 2152055450 is an apocalyptic number.
152055450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
152055450 is an abundant number, since it is smaller than the sum of its proper divisors (256468068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152055450 is a wasteful number, since it uses less digits than its factorization.
152055450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337919 (or 337911 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 27.
The square root of 152055450 is about 12331.0765953342. The cubic root of 152055450 is about 533.7452178508.
The spelling of 152055450 in words is "one hundred fifty-two million, fifty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •