Base | Representation |
---|---|
bin | 10010000111111… |
… | …11010011111001 |
3 | 101121002110121221 |
4 | 21003333103321 |
5 | 302410300242 |
6 | 23030432041 |
7 | 3524216224 |
oct | 1103772371 |
9 | 347073557 |
10 | 152040697 |
11 | 78906476 |
12 | 42b02621 |
13 | 25664a13 |
14 | 1629a5bb |
15 | d534167 |
hex | 90ff4f9 |
152040697 has 2 divisors, whose sum is σ = 152040698. Its totient is φ = 152040696.
The previous prime is 152040619. The next prime is 152040719. The reversal of 152040697 is 796040251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132158016 + 19882681 = 11496^2 + 4459^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152040697 is a prime.
It is equal to p8552590 and since 152040697 and 8552590 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (152040397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76020348 + 76020349.
It is an arithmetic number, because the mean of its divisors is an integer number (76020349).
Almost surely, 2152040697 is an apocalyptic number.
It is an amenable number.
152040697 is a deficient number, since it is larger than the sum of its proper divisors (1).
152040697 is an equidigital number, since it uses as much as digits as its factorization.
152040697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 34.
The square root of 152040697 is about 12330.4783767703. The cubic root of 152040697 is about 533.7279552932.
The spelling of 152040697 in words is "one hundred fifty-two million, forty thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •