Base | Representation |
---|---|
bin | 10010000000000… |
… | …01010001000011 |
3 | 101112010121020110 |
4 | 21000001101003 |
5 | 302124001011 |
6 | 22552242403 |
7 | 3512323422 |
oct | 1100012103 |
9 | 345117213 |
10 | 151000131 |
11 | 782656a7 |
12 | 426a0403 |
13 | 2538c1b9 |
14 | 160a92b9 |
15 | d3caba6 |
hex | 9001443 |
151000131 has 4 divisors (see below), whose sum is σ = 201333512. Its totient is φ = 100666752.
The previous prime is 151000123. The next prime is 151000153. The reversal of 151000131 is 131000151.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131000151 = 3 ⋅43666717.
It is not a de Polignac number, because 151000131 - 23 = 151000123 is a prime.
It is a super-2 number, since 2×1510001312 = 45602079124034322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151000121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25166686 + ... + 25166691.
It is an arithmetic number, because the mean of its divisors is an integer number (50333378).
Almost surely, 2151000131 is an apocalyptic number.
151000131 is a deficient number, since it is larger than the sum of its proper divisors (50333381).
151000131 is an equidigital number, since it uses as much as digits as its factorization.
151000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50333380.
The product of its (nonzero) digits is 15, while the sum is 12.
The square root of 151000131 is about 12288.2110577578. The cubic root of 151000131 is about 532.5075561537.
Adding to 151000131 its reverse (131000151), we get a palindrome (282000282).
The spelling of 151000131 in words is "one hundred fifty-one million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •