Base | Representation |
---|---|
bin | 10010001011101… |
… | …11010100100001 |
3 | 101122000102220212 |
4 | 21011313110201 |
5 | 303022013012 |
6 | 23045143505 |
7 | 3531334313 |
oct | 1105672441 |
9 | 348012825 |
10 | 152532257 |
11 | 79111819 |
12 | 430bab95 |
13 | 257a7697 |
14 | 163877b3 |
15 | d5ceb22 |
hex | 9177521 |
152532257 has 4 divisors (see below), whose sum is σ = 157792020. Its totient is φ = 147272496.
The previous prime is 152532253. The next prime is 152532271. The reversal of 152532257 is 752235251.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 752235251 = 19 ⋅39591329.
It can be written as a sum of positive squares in 2 ways, for example, as 34939921 + 117592336 = 5911^2 + 10844^2 .
It is a cyclic number.
It is not a de Polignac number, because 152532257 - 22 = 152532253 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152532253) 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 3 ways as a sum of consecutive naturals, for example, 2629838 + ... + 2629895.
It is an arithmetic number, because the mean of its divisors is an integer number (39448005).
Almost surely, 2152532257 is an apocalyptic number.
It is an amenable number.
152532257 is a deficient number, since it is larger than the sum of its proper divisors (5259763).
152532257 is an equidigital number, since it uses as much as digits as its factorization.
152532257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5259762.
The product of its digits is 21000, while the sum is 32.
The square root of 152532257 is about 12350.3950139257. The cubic root of 152532257 is about 534.3025318871.
The spelling of 152532257 in words is "one hundred fifty-two million, five hundred thirty-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •