Base | Representation |
---|---|
bin | 10010001011010… |
… | …11111010100001 |
3 | 101121221001211111 |
4 | 21011223322201 |
5 | 303014014122 |
6 | 23044143321 |
7 | 3531051151 |
oct | 1105537241 |
9 | 347831744 |
10 | 152485537 |
11 | 7908a706 |
12 | 43097b41 |
13 | 2578c339 |
14 | 16374761 |
15 | d5c0d77 |
hex | 916bea1 |
152485537 has 2 divisors, whose sum is σ = 152485538. Its totient is φ = 152485536.
The previous prime is 152485517. The next prime is 152485573. The reversal of 152485537 is 735584251.
152485537 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (152485573) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92948881 + 59536656 = 9641^2 + 7716^2 .
It is a cyclic number.
It is not a de Polignac number, because 152485537 - 223 = 144096929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 152485537.
It is not a weakly prime, because it can be changed into another prime (152485517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76242768 + 76242769.
It is an arithmetic number, because the mean of its divisors is an integer number (76242769).
Almost surely, 2152485537 is an apocalyptic number.
It is an amenable number.
152485537 is a deficient number, since it is larger than the sum of its proper divisors (1).
152485537 is an equidigital number, since it uses as much as digits as its factorization.
152485537 is an evil number, because the sum of its binary digits is even.
The product of its digits is 168000, while the sum is 40.
The square root of 152485537 is about 12348.5034315904. The cubic root of 152485537 is about 534.2479747640.
The spelling of 152485537 in words is "one hundred fifty-two million, four hundred eighty-five thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •