Base | Representation |
---|---|
bin | 111001110101000… |
… | …101001011010111 |
3 | 2111121122002100112 |
4 | 321311011023113 |
5 | 3441333404101 |
6 | 240135033235 |
7 | 33020462342 |
oct | 7165051327 |
9 | 2447562315 |
10 | 970216151 |
11 | 458730833 |
12 | 230b0b81b |
13 | 12600c6c8 |
14 | 92bd7459 |
15 | 5a29b6bb |
hex | 39d452d7 |
970216151 has 2 divisors, whose sum is σ = 970216152. Its totient is φ = 970216150.
The previous prime is 970216111. The next prime is 970216157. The reversal of 970216151 is 151612079.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-970216151 is a prime.
It is a super-2 number, since 2×9702161512 = 1882638759322509602, which contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (970216157) 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, 485108075 + 485108076.
It is an arithmetic number, because the mean of its divisors is an integer number (485108076).
Almost surely, 2970216151 is an apocalyptic number.
970216151 is a deficient number, since it is larger than the sum of its proper divisors (1).
970216151 is an equidigital number, since it uses as much as digits as its factorization.
970216151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 32.
The square root of 970216151 is about 31148.2929066747. The cubic root of 970216151 is about 989.9718221412.
The spelling of 970216151 in words is "nine hundred seventy million, two hundred sixteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •