Base | Representation |
---|---|
bin | 1000110011011101001… |
… | …1000110101000100111 |
3 | 112110101222120220020002 |
4 | 2030313103012220213 |
5 | 4434230403011101 |
6 | 153252314531515 |
7 | 13633104321305 |
oct | 2146723065047 |
9 | 473358526202 |
10 | 151251610151 |
11 | 59166655404 |
12 | 25391a36b9b |
13 | 11355973b95 |
14 | 746bab7275 |
15 | 3e03911d6b |
hex | 23374c6a27 |
151251610151 has 2 divisors, whose sum is σ = 151251610152. Its totient is φ = 151251610150.
The previous prime is 151251610109. The next prime is 151251610171. The reversal of 151251610151 is 151016152151.
151251610151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 151251610151 - 214 = 151251593767 is a prime.
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 (151251610171) 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, 75625805075 + 75625805076.
It is an arithmetic number, because the mean of its divisors is an integer number (75625805076).
Almost surely, 2151251610151 is an apocalyptic number.
151251610151 is a deficient number, since it is larger than the sum of its proper divisors (1).
151251610151 is an equidigital number, since it uses as much as digits as its factorization.
151251610151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 29.
The spelling of 151251610151 in words is "one hundred fifty-one billion, two hundred fifty-one million, six hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •