Base | Representation |
---|---|
bin | 10001101111100… |
… | …01110100000000 |
3 | 101101001211122202 |
4 | 20313301310000 |
5 | 301100332210 |
6 | 22434052332 |
7 | 3455054633 |
oct | 1067616400 |
9 | 341054582 |
10 | 148839680 |
11 | 7701a500 |
12 | 41a1a0a8 |
13 | 24ab3a22 |
14 | 15aa5c1a |
15 | d1009a5 |
hex | 8df1d00 |
148839680 has 162 divisors, whose sum is σ = 404923554. Its totient is φ = 52377600.
The previous prime is 148839679. The next prime is 148839683. The reversal of 148839680 is 86938841.
It can be written as a sum of positive squares in only one way, i.e., 119071744 + 29767936 = 10912^2 + 5456^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148839683) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 4801265 + ... + 4801295.
Almost surely, 2148839680 is an apocalyptic number.
148839680 is a gapful number since it is divisible by the number (10) 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 148839680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (202461777).
148839680 is an abundant number, since it is smaller than the sum of its proper divisors (256083874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148839680 is an equidigital number, since it uses as much as digits as its factorization.
148839680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105 (or 49 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 47.
The square root of 148839680 is about 12199.9868852389. The cubic root of 148839680 is about 529.9557100761.
The spelling of 148839680 in words is "one hundred forty-eight million, eight hundred thirty-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •