Base | Representation |
---|---|
bin | 10010001011101… |
… | …11010000100001 |
3 | 101122000102120101 |
4 | 21011313100201 |
5 | 303022011001 |
6 | 23045142401 |
7 | 3531333466 |
oct | 1105672041 |
9 | 348012511 |
10 | 152532001 |
11 | 79111606 |
12 | 430baa01 |
13 | 257a752b |
14 | 1638766d |
15 | d5cea01 |
hex | 9177421 |
152532001 has 2 divisors, whose sum is σ = 152532002. Its totient is φ = 152532000.
The previous prime is 152531993. The next prime is 152532011. The reversal of 152532001 is 100235251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 129960000 + 22572001 = 11400^2 + 4751^2 .
It is an emirp because it is prime and its reverse (100235251) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 152532001 - 23 = 152531993 is a prime.
It is a super-2 number, since 2×1525320012 = 46532022658128002, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 152532001.
It is not a weakly prime, because it can be changed into another prime (152532011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76266000 + 76266001.
It is an arithmetic number, because the mean of its divisors is an integer number (76266001).
Almost surely, 2152532001 is an apocalyptic number.
It is an amenable number.
152532001 is a deficient number, since it is larger than the sum of its proper divisors (1).
152532001 is an equidigital number, since it uses as much as digits as its factorization.
152532001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 152532001 is about 12350.3846498803. The cubic root of 152532001 is about 534.3022329743.
Adding to 152532001 its reverse (100235251), we get a palindrome (252767252).
The spelling of 152532001 in words is "one hundred fifty-two million, five hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •