Base | Representation |
---|---|
bin | 10010001100101… |
… | …01101000011101 |
3 | 101122020202020020 |
4 | 21012111220131 |
5 | 303040001123 |
6 | 23051542353 |
7 | 3532362300 |
oct | 1106255035 |
9 | 348222206 |
10 | 152656413 |
11 | 79197028 |
12 | 4315a9b9 |
13 | 2581c050 |
14 | 163bab37 |
15 | d6067e3 |
hex | 9195a1d |
152656413 has 96 divisors (see below), whose sum is σ = 279465984. Its totient is φ = 73156608.
The previous prime is 152656409. The next prime is 152656417. The reversal of 152656413 is 314656251.
It is an interprime number because it is at equal distance from previous prime (152656409) and next prime (152656417).
It is not a de Polignac number, because 152656413 - 22 = 152656409 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152656417) 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 95 ways as a sum of consecutive naturals, for example, 1201956 + ... + 1202082.
It is an arithmetic number, because the mean of its divisors is an integer number (2911104).
Almost surely, 2152656413 is an apocalyptic number.
152656413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
152656413 is a deficient number, since it is larger than the sum of its proper divisors (126809571).
152656413 is a wasteful number, since it uses less digits than its factorization.
152656413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211 (or 204 counting only the distinct ones).
The product of its digits is 21600, while the sum is 33.
The square root of 152656413 is about 12355.4203894485. The cubic root of 152656413 is about 534.4474605204.
The spelling of 152656413 in words is "one hundred fifty-two million, six hundred fifty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •