Base | Representation |
---|---|
bin | 10001110001001… |
… | …01010000000000 |
3 | 101101110112200000 |
4 | 20320211100000 |
5 | 301124102433 |
6 | 22442400000 |
7 | 3456623115 |
oct | 1070452000 |
9 | 341415600 |
10 | 149050368 |
11 | 77153825 |
12 | 41b00000 |
13 | 24b588ac |
14 | 15b1c90c |
15 | d143113 |
hex | 8e25400 |
149050368 has 132 divisors (see below), whose sum is σ = 447064800. Its totient is φ = 49600512.
The previous prime is 149050361. The next prime is 149050379. The reversal of 149050368 is 863050941.
149050368 is a `hidden beast` number, since 1 + 4 + 90 + 503 + 68 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (149050361) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 248533 + ... + 249131.
Almost surely, 2149050368 is an apocalyptic number.
149050368 is a gapful number since it is divisible by the number (18) 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 149050368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223532400).
149050368 is an abundant number, since it is smaller than the sum of its proper divisors (298014432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149050368 is an frugal number, since it uses more digits than its factorization.
149050368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 634 (or 604 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 149050368 is about 12208.6185950745. The cubic root of 149050368 is about 530.2056493978.
The spelling of 149050368 in words is "one hundred forty-nine million, fifty thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •