Base | Representation |
---|---|
bin | 10010000001000… |
… | …01001100011111 |
3 | 101112101020122011 |
4 | 21000201030133 |
5 | 302142142121 |
6 | 22555132051 |
7 | 3513406621 |
oct | 1100411437 |
9 | 345336564 |
10 | 151130911 |
11 | 78344988 |
12 | 42744027 |
13 | 25406899 |
14 | 16100c11 |
15 | d4047e1 |
hex | 902131f |
151130911 has 2 divisors, whose sum is σ = 151130912. Its totient is φ = 151130910.
The previous prime is 151130893. The next prime is 151130927. The reversal of 151130911 is 119031151.
It is a strong prime.
It is an emirp because it is prime and its reverse (119031151) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151130911 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151130981) 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, 75565455 + 75565456.
It is an arithmetic number, because the mean of its divisors is an integer number (75565456).
Almost surely, 2151130911 is an apocalyptic number.
151130911 is a deficient number, since it is larger than the sum of its proper divisors (1).
151130911 is an equidigital number, since it uses as much as digits as its factorization.
151130911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 22.
The square root of 151130911 is about 12293.5312664832. The cubic root of 151130911 is about 532.6612452976.
The spelling of 151130911 in words is "one hundred fifty-one million, one hundred thirty thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •