Base | Representation |
---|---|
bin | 10001110110110… |
… | …01111011110100 |
3 | 101102212010212112 |
4 | 20323121323310 |
5 | 301321243302 |
6 | 22510310152 |
7 | 3466124600 |
oct | 1073317364 |
9 | 342763775 |
10 | 149790452 |
11 | 77609869 |
12 | 421b8358 |
13 | 25057706 |
14 | 15c72500 |
15 | d23c552 |
hex | 8ed9ef4 |
149790452 has 108 divisors (see below), whose sum is σ = 337482180. Its totient is φ = 57915648.
The previous prime is 149790449. The next prime is 149790461. The reversal of 149790452 is 254097941.
It can be written as a sum of positive squares in 2 ways, for example, as 81793936 + 67996516 = 9044^2 + 8246^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2051888 + ... + 2051960.
It is an arithmetic number, because the mean of its divisors is an integer number (3124835).
Almost surely, 2149790452 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 149790452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168741090).
149790452 is an abundant number, since it is smaller than the sum of its proper divisors (187691728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149790452 is a wasteful number, since it uses less digits than its factorization.
149790452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158 (or 130 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 41.
The square root of 149790452 is about 12238.8909628283. The cubic root of 149790452 is about 531.0817493123.
The spelling of 149790452 in words is "one hundred forty-nine million, seven hundred ninety thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •