Base | Representation |
---|---|
bin | 10010001000000… |
… | …11001110011100 |
3 | 101121010021121211 |
4 | 21010003032130 |
5 | 302411303412 |
6 | 23031034204 |
7 | 3524314042 |
oct | 1104031634 |
9 | 347107554 |
10 | 152056732 |
11 | 78917523 |
12 | 42b0b964 |
13 | 2566c0c9 |
14 | 162a2392 |
15 | d538ca7 |
hex | 910339c |
152056732 has 12 divisors (see below), whose sum is σ = 267242976. Its totient is φ = 75701600.
The previous prime is 152056699. The next prime is 152056757. The reversal of 152056732 is 237650251.
It is a junction number, because it is equal to n+sod(n) for n = 152056694 and 152056703.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 80644 + ... + 82507.
It is an arithmetic number, because the mean of its divisors is an integer number (22270248).
Almost surely, 2152056732 is an apocalyptic number.
It is an amenable number.
152056732 is a deficient number, since it is larger than the sum of its proper divisors (115186244).
152056732 is a wasteful number, since it uses less digits than its factorization.
152056732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163388 (or 163386 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 31.
The square root of 152056732 is about 12331.1285777093. The cubic root of 152056732 is about 533.7467178726.
The spelling of 152056732 in words is "one hundred fifty-two million, fifty-six thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •