Base | Representation |
---|---|
bin | 10001101110100… |
… | …01111101111001 |
3 | 101100211012201200 |
4 | 20313101331321 |
5 | 301032143431 |
6 | 22431204413 |
7 | 3454002432 |
oct | 1067217571 |
9 | 340735650 |
10 | 148709241 |
11 | 76a404aa |
12 | 41976709 |
13 | 24a69545 |
14 | 15a70489 |
15 | d0c6ee6 |
hex | 8dd1f79 |
148709241 has 6 divisors (see below), whose sum is σ = 214802250. Its totient is φ = 99139488.
The previous prime is 148709233. The next prime is 148709261. The reversal of 148709241 is 142907841.
It can be written as a sum of positive squares in only one way, i.e., 145805625 + 2903616 = 12075^2 + 1704^2 .
It is not a de Polignac number, because 148709241 - 23 = 148709233 is a prime.
It is a super-2 number, since 2×1487092412 = 44228876717592162, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 148709196 and 148709205.
It is not an unprimeable number, because it can be changed into a prime (148709261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8261616 + ... + 8261633.
It is an arithmetic number, because the mean of its divisors is an integer number (35800375).
Almost surely, 2148709241 is an apocalyptic number.
It is an amenable number.
148709241 is a deficient number, since it is larger than the sum of its proper divisors (66093009).
148709241 is a wasteful number, since it uses less digits than its factorization.
148709241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16523255 (or 16523252 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The square root of 148709241 is about 12194.6398470804. The cubic root of 148709241 is about 529.8008519623.
The spelling of 148709241 in words is "one hundred forty-eight million, seven hundred nine thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •