Base | Representation |
---|---|
bin | 10001111111010… |
… | …00000110011001 |
3 | 101111221100211121 |
4 | 20333220012121 |
5 | 302112201144 |
6 | 22550125241 |
7 | 3511414042 |
oct | 1077500631 |
9 | 344840747 |
10 | 150897049 |
11 | 781a5206 |
12 | 42650821 |
13 | 253542c4 |
14 | 1607d8c9 |
15 | d3aa384 |
hex | 8fe8199 |
150897049 has 4 divisors (see below), whose sum is σ = 159773364. Its totient is φ = 142020736.
The previous prime is 150897041. The next prime is 150897053. The reversal of 150897049 is 940798051.
150897049 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 82537225 + 68359824 = 9085^2 + 8268^2 .
It is a cyclic number.
It is not a de Polignac number, because 150897049 - 23 = 150897041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 150896996 and 150897014.
It is not an unprimeable number, because it can be changed into a prime (150897041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4438132 + ... + 4438165.
It is an arithmetic number, because the mean of its divisors is an integer number (39943341).
Almost surely, 2150897049 is an apocalyptic number.
It is an amenable number.
150897049 is a deficient number, since it is larger than the sum of its proper divisors (8876315).
150897049 is an equidigital number, since it uses as much as digits as its factorization.
150897049 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8876314.
The product of its (nonzero) digits is 90720, while the sum is 43.
The square root of 150897049 is about 12284.0159964077. The cubic root of 150897049 is about 532.3863544056.
The spelling of 150897049 in words is "one hundred fifty million, eight hundred ninety-seven thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •