Base | Representation |
---|---|
bin | 10010000001010… |
… | …00110001110011 |
3 | 101112102211020112 |
4 | 21000220301303 |
5 | 302144140341 |
6 | 22555531535 |
7 | 3513566312 |
oct | 1100506163 |
9 | 345384215 |
10 | 151161971 |
11 | 78366254 |
12 | 42759bab |
13 | 25417a6c |
14 | 1610c279 |
15 | d40daeb |
hex | 9028c73 |
151161971 has 2 divisors, whose sum is σ = 151161972. Its totient is φ = 151161970.
The previous prime is 151161937. The next prime is 151161973. The reversal of 151161971 is 179161151.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 151161971 - 214 = 151145587 is a prime.
It is a Sophie Germain prime.
Together with 151161973, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (151161973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75580985 + 75580986.
It is an arithmetic number, because the mean of its divisors is an integer number (75580986).
Almost surely, 2151161971 is an apocalyptic number.
151161971 is a deficient number, since it is larger than the sum of its proper divisors (1).
151161971 is an equidigital number, since it uses as much as digits as its factorization.
151161971 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1890, while the sum is 32.
The square root of 151161971 is about 12294.7944675785. The cubic root of 151161971 is about 532.6977331453.
The spelling of 151161971 in words is "one hundred fifty-one million, one hundred sixty-one thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •