Base | Representation |
---|---|
bin | 10001110001001… |
… | …10101101010001 |
3 | 101101110211212002 |
4 | 20320212231101 |
5 | 301124300322 |
6 | 22442443345 |
7 | 3456646403 |
oct | 1070465521 |
9 | 341424762 |
10 | 149056337 |
11 | 77158261 |
12 | 41b03555 |
13 | 24b5b521 |
14 | 15b20b73 |
15 | d144c92 |
hex | 8e26b51 |
149056337 has 2 divisors, whose sum is σ = 149056338. Its totient is φ = 149056336.
The previous prime is 149056333. The next prime is 149056363. The reversal of 149056337 is 733650941.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112381201 + 36675136 = 10601^2 + 6056^2 .
It is a cyclic number.
It is not a de Polignac number, because 149056337 - 22 = 149056333 is a prime.
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 149056337.
It is not a weakly prime, because it can be changed into another prime (149056333) 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, 74528168 + 74528169.
It is an arithmetic number, because the mean of its divisors is an integer number (74528169).
Almost surely, 2149056337 is an apocalyptic number.
It is an amenable number.
149056337 is a deficient number, since it is larger than the sum of its proper divisors (1).
149056337 is an equidigital number, since it uses as much as digits as its factorization.
149056337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 38.
The square root of 149056337 is about 12208.8630510789. The cubic root of 149056337 is about 530.2127269947.
The spelling of 149056337 in words is "one hundred forty-nine million, fifty-six thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •