Base | Representation |
---|---|
bin | 10010001011101… |
… | …01111001000001 |
3 | 101122000010212222 |
4 | 21011311321001 |
5 | 303021321101 |
6 | 23045100425 |
7 | 3531311246 |
oct | 1105657101 |
9 | 348003788 |
10 | 152526401 |
11 | 79108385 |
12 | 430b7715 |
13 | 257a4b11 |
14 | 163855cd |
15 | d5cd01b |
hex | 9175e41 |
152526401 has 2 divisors, whose sum is σ = 152526402. Its totient is φ = 152526400.
The previous prime is 152526377. The next prime is 152526427. The reversal of 152526401 is 104625251.
It is an a-pointer prime, because the next prime (152526427) can be obtained adding 152526401 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 143520400 + 9006001 = 11980^2 + 3001^2 .
It is an emirp because it is prime and its reverse (104625251) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 152526401 - 26 = 152526337 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (152526481) 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 as a sum of consecutive naturals, namely, 76263200 + 76263201.
It is an arithmetic number, because the mean of its divisors is an integer number (76263201).
Almost surely, 2152526401 is an apocalyptic number.
It is an amenable number.
152526401 is a deficient number, since it is larger than the sum of its proper divisors (1).
152526401 is an equidigital number, since it uses as much as digits as its factorization.
152526401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 152526401 is about 12350.1579342128. The cubic root of 152526401 is about 534.2956941735.
The spelling of 152526401 in words is "one hundred fifty-two million, five hundred twenty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •