Base | Representation |
---|---|
bin | 10001111100101… |
… | …10110100100011 |
3 | 101111022110011022 |
4 | 20332112310203 |
5 | 302021023011 |
6 | 22535040055 |
7 | 3505526324 |
oct | 1076266443 |
9 | 344273138 |
10 | 150564131 |
11 | 77a98073 |
12 | 4251002b |
13 | 25268903 |
14 | 15dd444b |
15 | d3418db |
hex | 8f96d23 |
150564131 has 2 divisors, whose sum is σ = 150564132. Its totient is φ = 150564130.
The previous prime is 150564109. The next prime is 150564133. The reversal of 150564131 is 131465051.
It is a strong prime.
It is an emirp because it is prime and its reverse (131465051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150564131 - 26 = 150564067 is a prime.
It is a super-2 number, since 2×1505641312 = 45339115087570322, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 150564133, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 150564131.
It is not a weakly prime, because it can be changed into another prime (150564133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75282065 + 75282066.
It is an arithmetic number, because the mean of its divisors is an integer number (75282066).
Almost surely, 2150564131 is an apocalyptic number.
150564131 is a deficient number, since it is larger than the sum of its proper divisors (1).
150564131 is an equidigital number, since it uses as much as digits as its factorization.
150564131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 150564131 is about 12270.4576524268. The cubic root of 150564131 is about 531.9945386874.
The spelling of 150564131 in words is "one hundred fifty million, five hundred sixty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •