Base | Representation |
---|---|
bin | 10010001001100… |
… | …00100101101001 |
3 | 101121110201111111 |
4 | 21010300211221 |
5 | 302433230122 |
6 | 23035030321 |
7 | 3526016536 |
oct | 1104604551 |
9 | 347421444 |
10 | 152242537 |
11 | 78a34087 |
12 | 42b9b3a1 |
13 | 25705855 |
14 | 1630dd8d |
15 | d573d77 |
hex | 9130969 |
152242537 has 2 divisors, whose sum is σ = 152242538. Its totient is φ = 152242536.
The previous prime is 152242529. The next prime is 152242583. The reversal of 152242537 is 735242251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132342016 + 19900521 = 11504^2 + 4461^2 .
It is a cyclic number.
It is not a de Polignac number, because 152242537 - 23 = 152242529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 152242499 and 152242508.
It is not a weakly prime, because it can be changed into another prime (152212537) 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 as a sum of consecutive naturals, namely, 76121268 + 76121269.
It is an arithmetic number, because the mean of its divisors is an integer number (76121269).
Almost surely, 2152242537 is an apocalyptic number.
It is an amenable number.
152242537 is a deficient number, since it is larger than the sum of its proper divisors (1).
152242537 is an equidigital number, since it uses as much as digits as its factorization.
152242537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16800, while the sum is 31.
The square root of 152242537 is about 12338.6602595257. The cubic root of 152242537 is about 533.9640324683.
Adding to 152242537 its reverse (735242251), we get a palindrome (887484788).
The spelling of 152242537 in words is "one hundred fifty-two million, two hundred forty-two thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •