Base | Representation |
---|---|
bin | 10001101101011… |
… | …00110100001001 |
3 | 101100112110222112 |
4 | 20312230310021 |
5 | 301012311230 |
6 | 22424032105 |
7 | 3452466656 |
oct | 1066546411 |
9 | 340473875 |
10 | 148557065 |
11 | 76947138 |
12 | 41902635 |
13 | 24a151b7 |
14 | 15a30c2d |
15 | d096d95 |
hex | 8dacd09 |
148557065 has 4 divisors (see below), whose sum is σ = 178268484. Its totient is φ = 118845648.
The previous prime is 148557047. The next prime is 148557089. The reversal of 148557065 is 560755841.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 560755841 = 109 ⋅5144549.
It can be written as a sum of positive squares in 2 ways, for example, as 19598329 + 128958736 = 4427^2 + 11356^2 .
It is a cyclic number.
It is not a de Polignac number, because 148557065 - 26 = 148557001 is a prime.
It is a super-2 number, since 2×1485570652 = 44138403122828450, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14855702 + ... + 14855711.
It is an arithmetic number, because the mean of its divisors is an integer number (44567121).
Almost surely, 2148557065 is an apocalyptic number.
It is an amenable number.
148557065 is a deficient number, since it is larger than the sum of its proper divisors (29711419).
148557065 is an equidigital number, since it uses as much as digits as its factorization.
148557065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29711418.
The product of its (nonzero) digits is 168000, while the sum is 41.
The square root of 148557065 is about 12188.3987873715. The cubic root of 148557065 is about 529.6200730356.
The spelling of 148557065 in words is "one hundred forty-eight million, five hundred fifty-seven thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •