Base | Representation |
---|---|
bin | 10001110111101… |
… | …10001010000010 |
3 | 101110002000102221 |
4 | 20323312022002 |
5 | 301333443200 |
6 | 22513001254 |
7 | 3500115610 |
oct | 1073661202 |
9 | 343060387 |
10 | 149906050 |
11 | 776886a8 |
12 | 4225322a |
13 | 25098208 |
14 | 15ca26b0 |
15 | d26191a |
hex | 8ef6282 |
149906050 has 24 divisors (see below), whose sum is σ = 318658176. Its totient is φ = 51396240.
The previous prime is 149905979. The next prime is 149906059. The reversal of 149906050 is 50609941.
It is a hoax number, since the sum of its digits (34) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 149905997 and 149906015.
It is not an unprimeable number, because it can be changed into a prime (149906059) 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 in 11 ways as a sum of consecutive naturals, for example, 213802 + ... + 214501.
It is an arithmetic number, because the mean of its divisors is an integer number (13277424).
Almost surely, 2149906050 is an apocalyptic number.
149906050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
149906050 is an abundant number, since it is smaller than the sum of its proper divisors (168752126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149906050 is a wasteful number, since it uses less digits than its factorization.
149906050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428322 (or 428317 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 34.
The square root of 149906050 is about 12243.6126204646. The cubic root of 149906050 is about 531.2183316763.
The spelling of 149906050 in words is "one hundred forty-nine million, nine hundred six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •