Base | Representation |
---|---|
bin | 10010110001110… |
… | …111111101010111 |
3 | 210221211220202122 |
4 | 102301313331113 |
5 | 1121124023101 |
6 | 51132530155 |
7 | 10544000243 |
oct | 2261677527 |
9 | 727756678 |
10 | 315064151 |
11 | 1519333a6 |
12 | 8962095b |
13 | 503736bc |
14 | 2dbb5423 |
15 | 1c9d751b |
hex | 12c77f57 |
315064151 has 2 divisors, whose sum is σ = 315064152. Its totient is φ = 315064150.
The previous prime is 315064093. The next prime is 315064153. The reversal of 315064151 is 151460513.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 315064151 - 226 = 247955287 is a prime.
Together with 315064153, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 315064151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (315064153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157532075 + 157532076.
It is an arithmetic number, because the mean of its divisors is an integer number (157532076).
Almost surely, 2315064151 is an apocalyptic number.
315064151 is a deficient number, since it is larger than the sum of its proper divisors (1).
315064151 is an equidigital number, since it uses as much as digits as its factorization.
315064151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 315064151 is about 17750.0465069813. The cubic root of 315064151 is about 680.4553978055.
The spelling of 315064151 in words is "three hundred fifteen million, sixty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •