Base | Representation |
---|---|
bin | 10001101001001… |
… | …01000000000010 |
3 | 101022111012220000 |
4 | 20310211000002 |
5 | 300342011040 |
6 | 22404100430 |
7 | 3444662061 |
oct | 1064450002 |
9 | 338435800 |
10 | 148000770 |
11 | 765a7195 |
12 | 41694716 |
13 | 2487bc28 |
14 | 159281d8 |
15 | ced7130 |
hex | 8d25002 |
148000770 has 80 divisors (see below), whose sum is σ = 402625080. Its totient is φ = 39004416.
The previous prime is 148000739. The next prime is 148000771. The reversal of 148000770 is 77000841.
It can be written as a sum of positive squares in 4 ways, for example, as 97831881 + 50168889 = 9891^2 + 7083^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (148000771) 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, 71064 + ... + 73116.
Almost surely, 2148000770 is an apocalyptic number.
148000770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 148000770, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (201312540).
148000770 is an abundant number, since it is smaller than the sum of its proper divisors (254624310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148000770 is a wasteful number, since it uses less digits than its factorization.
148000770 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2161 (or 2152 counting only the distinct ones).
The product of its (nonzero) digits is 1568, while the sum is 27.
The square root of 148000770 is about 12165.5567073603. The cubic root of 148000770 is about 528.9581646036.
The spelling of 148000770 in words is "one hundred forty-eight million, seven hundred seventy", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •