Base | Representation |
---|---|
bin | 10001111101110… |
… | …01010000000101 |
3 | 101111120121121111 |
4 | 20332321100011 |
5 | 302040031112 |
6 | 22542045021 |
7 | 3506654431 |
oct | 1076712005 |
9 | 344517544 |
10 | 150705157 |
11 | 78084019 |
12 | 42579771 |
13 | 252b7b65 |
14 | 1602d9c1 |
15 | d36d5a7 |
hex | 8fb9405 |
150705157 has 4 divisors (see below), whose sum is σ = 150761836. Its totient is φ = 150648480.
The previous prime is 150705143. The next prime is 150705161. The reversal of 150705157 is 751507051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 751507051 = 2531 ⋅296921.
It can be written as a sum of positive squares in 2 ways, for example, as 96550276 + 54154881 = 9826^2 + 7359^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150705157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150705127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24144 + ... + 29737.
It is an arithmetic number, because the mean of its divisors is an integer number (37690459).
Almost surely, 2150705157 is an apocalyptic number.
It is an amenable number.
150705157 is a deficient number, since it is larger than the sum of its proper divisors (56679).
150705157 is an equidigital number, since it uses as much as digits as its factorization.
150705157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56678.
The product of its (nonzero) digits is 6125, while the sum is 31.
The square root of 150705157 is about 12276.2028738531. The cubic root of 150705157 is about 532.1605845431.
The spelling of 150705157 in words is "one hundred fifty million, seven hundred five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •