Base | Representation |
---|---|
bin | 10001101001010… |
… | …10000110000101 |
3 | 101022112021111212 |
4 | 20310222012011 |
5 | 300343143022 |
6 | 22404341205 |
7 | 3445106651 |
oct | 1064520605 |
9 | 338467455 |
10 | 148021637 |
11 | 76610935 |
12 | 416a4805 |
13 | 2488858a |
14 | 15931a61 |
15 | cedd3e2 |
hex | 8d2a185 |
148021637 has 4 divisors (see below), whose sum is σ = 148096620. Its totient is φ = 147946656.
The previous prime is 148021631. The next prime is 148021651. The reversal of 148021637 is 736120841.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 736120841 = 1873 ⋅393017.
It can be written as a sum of positive squares in 2 ways, for example, as 119814916 + 28206721 = 10946^2 + 5311^2 .
It is a cyclic number.
It is not a de Polignac number, because 148021637 - 220 = 146973061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148021631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34448 + ... + 38505.
It is an arithmetic number, because the mean of its divisors is an integer number (37024155).
Almost surely, 2148021637 is an apocalyptic number.
It is an amenable number.
148021637 is a deficient number, since it is larger than the sum of its proper divisors (74983).
148021637 is an equidigital number, since it uses as much as digits as its factorization.
148021637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74982.
The product of its (nonzero) digits is 8064, while the sum is 32.
The square root of 148021637 is about 12166.4143033188. The cubic root of 148021637 is about 528.9830231484.
The spelling of 148021637 in words is "one hundred forty-eight million, twenty-one thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •