Base | Representation |
---|---|
bin | 10010001101001… |
… | …01011010100101 |
3 | 101122101000220121 |
4 | 21012211122211 |
5 | 303044033221 |
6 | 23053201541 |
7 | 3533051623 |
oct | 1106453245 |
9 | 348330817 |
10 | 152721061 |
11 | 79230659 |
12 | 431902b1 |
13 | 258425bc |
14 | 163d6513 |
15 | d61aa41 |
hex | 91a56a5 |
152721061 has 2 divisors, whose sum is σ = 152721062. Its totient is φ = 152721060.
The previous prime is 152721059. The next prime is 152721067. The reversal of 152721061 is 160127251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 148596100 + 4124961 = 12190^2 + 2031^2 .
It is an emirp because it is prime and its reverse (160127251) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 152721061 - 21 = 152721059 is a prime.
Together with 152721059, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152721067) 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, 76360530 + 76360531.
It is an arithmetic number, because the mean of its divisors is an integer number (76360531).
Almost surely, 2152721061 is an apocalyptic number.
It is an amenable number.
152721061 is a deficient number, since it is larger than the sum of its proper divisors (1).
152721061 is an equidigital number, since it uses as much as digits as its factorization.
152721061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
The square root of 152721061 is about 12358.0362922270. The cubic root of 152721061 is about 534.5228937163.
The spelling of 152721061 in words is "one hundred fifty-two million, seven hundred twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •