Base | Representation |
---|---|
bin | 10010001011100… |
… | …01000000101101 |
3 | 101121222010110200 |
4 | 21011301000231 |
5 | 303020201123 |
6 | 23044424113 |
7 | 3531166053 |
oct | 1105610055 |
9 | 347863420 |
10 | 152506413 |
11 | 790a4364 |
12 | 430a8039 |
13 | 257989a7 |
14 | 1637c1d3 |
15 | d5c7143 |
hex | 917102d |
152506413 has 12 divisors (see below), whose sum is σ = 220408188. Its totient is φ = 101615040.
The previous prime is 152506411. The next prime is 152506421. The reversal of 152506413 is 314605251.
152506413 is a `hidden beast` number, since 15 + 2 + 5 + 0 + 641 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 96884649 + 55621764 = 9843^2 + 7458^2 .
It is not a de Polignac number, because 152506413 - 21 = 152506411 is a prime.
It is a super-2 number, since 2×1525064132 = 46516412012253138, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152506411) 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 11 ways as a sum of consecutive naturals, for example, 18873 + ... + 25713.
It is an arithmetic number, because the mean of its divisors is an integer number (18367349).
Almost surely, 2152506413 is an apocalyptic number.
It is an amenable number.
152506413 is a deficient number, since it is larger than the sum of its proper divisors (67901775).
152506413 is a wasteful number, since it uses less digits than its factorization.
152506413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9324 (or 9321 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 152506413 is about 12349.3486872790. The cubic root of 152506413 is about 534.2723540199.
The spelling of 152506413 in words is "one hundred fifty-two million, five hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •