Base | Representation |
---|---|
bin | 10001101100001… |
… | …00000010101000 |
3 | 101100012222220000 |
4 | 20312010002220 |
5 | 300441440211 |
6 | 22420303000 |
7 | 3451203033 |
oct | 1066040250 |
9 | 340188800 |
10 | 148390056 |
11 | 76842711 |
12 | 41841a60 |
13 | 24987189 |
14 | 159ca01a |
15 | d062656 |
hex | 8d840a8 |
148390056 has 160 divisors (see below), whose sum is σ = 439084800. Its totient is φ = 46759680.
The previous prime is 148390051. The next prime is 148390063. The reversal of 148390056 is 650093841.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 148390056.
It is not an unprimeable number, because it can be changed into a prime (148390051) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1667260 + ... + 1667348.
It is an arithmetic number, because the mean of its divisors is an integer number (2744280).
Almost surely, 2148390056 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 148390056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219542400).
148390056 is an abundant number, since it is smaller than the sum of its proper divisors (290694744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148390056 is a wasteful number, since it uses less digits than its factorization.
148390056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221 (or 208 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 148390056 is about 12181.5457147277. The cubic root of 148390056 is about 529.4215309571.
The spelling of 148390056 in words is "one hundred forty-eight million, three hundred ninety thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •