Base | Representation |
---|---|
bin | 10001110101101… |
… | …00100010010000 |
3 | 101102120100201220 |
4 | 20322310202100 |
5 | 301301343024 |
6 | 22503125040 |
7 | 3464616150 |
oct | 1072644220 |
9 | 342510656 |
10 | 149637264 |
11 | 77514767 |
12 | 42143780 |
13 | 25002a7a |
14 | 15c32760 |
15 | d20be79 |
hex | 8eb4890 |
149637264 has 240 divisors, whose sum is σ = 497015808. Its totient is φ = 37914624.
The previous prime is 149637263. The next prime is 149637283. The reversal of 149637264 is 462736941.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (149637263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2233359 + ... + 2233425.
Almost surely, 2149637264 is an apocalyptic number.
149637264 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 149637264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (248507904).
149637264 is an abundant number, since it is smaller than the sum of its proper divisors (347378544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149637264 is a wasteful number, since it uses less digits than its factorization.
149637264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142 (or 119 counting only the distinct ones).
The product of its digits is 217728, while the sum is 42.
The square root of 149637264 is about 12232.6311151771. The cubic root of 149637264 is about 530.9006449779.
The spelling of 149637264 in words is "one hundred forty-nine million, six hundred thirty-seven thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •