Base | Representation |
---|---|
bin | 10001110001111… |
… | …01101101001001 |
3 | 101101122122001222 |
4 | 20320331231021 |
5 | 301140304122 |
6 | 22444451425 |
7 | 3460521134 |
oct | 1070755511 |
9 | 341578058 |
10 | 149150537 |
11 | 77212008 |
12 | 41b49b75 |
13 | 24b92373 |
14 | 15b4721b |
15 | d162b42 |
hex | 8e3db49 |
149150537 has 4 divisors (see below), whose sum is σ = 157924116. Its totient is φ = 140376960.
The previous prime is 149150527. The next prime is 149150549. The reversal of 149150537 is 735051941.
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 80658361 + 68492176 = 8981^2 + 8276^2 .
It is a cyclic number.
It is not a de Polignac number, because 149150537 - 212 = 149146441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 149150497 and 149150506.
It is not an unprimeable number, because it can be changed into a prime (149150527) 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, 4386764 + ... + 4386797.
It is an arithmetic number, because the mean of its divisors is an integer number (39481029).
Almost surely, 2149150537 is an apocalyptic number.
149150537 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
149150537 is a deficient number, since it is larger than the sum of its proper divisors (8773579).
149150537 is an equidigital number, since it uses as much as digits as its factorization.
149150537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8773578.
The product of its (nonzero) digits is 18900, while the sum is 35.
The square root of 149150537 is about 12212.7202948401. The cubic root of 149150537 is about 530.3243973471.
The spelling of 149150537 in words is "one hundred forty-nine million, one hundred fifty thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •