Base | Representation |
---|---|
bin | 10001111101001… |
… | …11001010001001 |
3 | 101111102211221202 |
4 | 20332213022021 |
5 | 302030143144 |
6 | 22540313545 |
7 | 3506225402 |
oct | 1076471211 |
9 | 344384852 |
10 | 150631049 |
11 | 78033378 |
12 | 425428b5 |
13 | 252901ca |
14 | 160109a9 |
15 | d35664e |
hex | 8fa7289 |
150631049 has 2 divisors, whose sum is σ = 150631050. Its totient is φ = 150631048.
The previous prime is 150631003. The next prime is 150631051. The reversal of 150631049 is 940136051.
150631049 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 can be written as a sum of positive squares in only one way, i.e., 138485824 + 12145225 = 11768^2 + 3485^2 .
It is an emirp because it is prime and its reverse (940136051) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 150631049 - 28 = 150630793 is a prime.
It is a Sophie Germain prime.
Together with 150631051, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (150631079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75315524 + 75315525.
It is an arithmetic number, because the mean of its divisors is an integer number (75315525).
Almost surely, 2150631049 is an apocalyptic number.
It is an amenable number.
150631049 is a deficient number, since it is larger than the sum of its proper divisors (1).
150631049 is an equidigital number, since it uses as much as digits as its factorization.
150631049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3240, while the sum is 29.
The square root of 150631049 is about 12273.1841426746. The cubic root of 150631049 is about 532.0733417363.
The spelling of 150631049 in words is "one hundred fifty million, six hundred thirty-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •