Base | Representation |
---|---|
bin | 10001110100011… |
… | …00110100110001 |
3 | 101102021002121122 |
4 | 20322030310301 |
5 | 301231141414 |
6 | 22455432025 |
7 | 3463341014 |
oct | 1072146461 |
9 | 342232548 |
10 | 149474609 |
11 | 77413539 |
12 | 42085615 |
13 | 24c76a1b |
14 | 15bcd37b |
15 | d1c8b8e |
hex | 8e8cd31 |
149474609 has 2 divisors, whose sum is σ = 149474610. Its totient is φ = 149474608.
The previous prime is 149474597. The next prime is 149474621. The reversal of 149474609 is 906474941.
It is a balanced prime because it is at equal distance from previous prime (149474597) and next prime (149474621).
It can be written as a sum of positive squares in only one way, i.e., 92698384 + 56776225 = 9628^2 + 7535^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-149474609 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 149474609.
It is not a weakly prime, because it can be changed into another prime (149474629) 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 as a sum of consecutive naturals, namely, 74737304 + 74737305.
It is an arithmetic number, because the mean of its divisors is an integer number (74737305).
Almost surely, 2149474609 is an apocalyptic number.
It is an amenable number.
149474609 is a deficient number, since it is larger than the sum of its proper divisors (1).
149474609 is an equidigital number, since it uses as much as digits as its factorization.
149474609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 44.
The square root of 149474609 is about 12225.9809013428. The cubic root of 149474609 is about 530.7082130714.
The spelling of 149474609 in words is "one hundred forty-nine million, four hundred seventy-four thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •