Base | Representation |
---|---|
bin | 10001110110001… |
… | …10100000000000 |
3 | 101102201002200020 |
4 | 20323012200000 |
5 | 301311221343 |
6 | 22504453440 |
7 | 3465343530 |
oct | 1073064000 |
9 | 342632606 |
10 | 149710848 |
11 | 77564a81 |
12 | 4217a280 |
13 | 2502a401 |
14 | 15c514c0 |
15 | d223b83 |
hex | 8ec6800 |
149710848 has 144 divisors (see below), whose sum is σ = 464012640. Its totient is φ = 42049536.
The previous prime is 149710837. The next prime is 149710901. The reversal of 149710848 is 848017941.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2537443 + ... + 2537501.
It is an arithmetic number, because the mean of its divisors is an integer number (3222310).
Almost surely, 2149710848 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 149710848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (232006320).
149710848 is an abundant number, since it is smaller than the sum of its proper divisors (314301792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149710848 is an frugal number, since it uses more digits than its factorization.
149710848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150 (or 71 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 42.
The square root of 149710848 is about 12235.6384385940. The cubic root of 149710848 is about 530.9876540339.
Multiplying 149710848 by its sum of digits (42), we get a square (6287855616 = 792962).
149710848 divided by its sum of digits (42) gives a square (3564544 = 18882).
The spelling of 149710848 in words is "one hundred forty-nine million, seven hundred ten thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •