Base | Representation |
---|---|
bin | 1111010001110… |
… | …10010010110001 |
3 | 22221011110101101 |
4 | 13220322102301 |
5 | 230302240131 |
6 | 20415004401 |
7 | 3114246004 |
oct | 750722261 |
9 | 287143341 |
10 | 128165041 |
11 | 66389324 |
12 | 36b09701 |
13 | 20725504 |
14 | 1304353b |
15 | b3b9c61 |
hex | 7a3a4b1 |
128165041 has 3 divisors (see below), whose sum is σ = 128176363. Its totient is φ = 128153720.
The previous prime is 128165027. The next prime is 128165047. The reversal of 128165041 is 140561821.
The square root of 128165041 is 11321.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 140561821 = 131 ⋅1072991.
It can be written as a sum of positive squares in only one way, i.e., 9790641 + 118374400 = 3129^2 + 10880^2 .
It is not a de Polignac number, because 128165041 - 27 = 128164913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (128165047) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 5661 + ... + 16981.
Almost surely, 2128165041 is an apocalyptic number.
128165041 is the 11321-st square number.
128165041 is the 5661-st centered octagonal number.
It is an amenable number.
128165041 is a deficient number, since it is larger than the sum of its proper divisors (11322).
128165041 is an frugal number, since it uses more digits than its factorization.
128165041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22642 (or 11321 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 28.
The cubic root of 128165041 is about 504.1849296695.
The spelling of 128165041 in words is "one hundred twenty-eight million, one hundred sixty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •