Base | Representation |
---|---|
bin | 1111100011111… |
… | …1000111100001 |
3 | 11112211001221100 |
4 | 3320333013201 |
5 | 113202121431 |
6 | 10250545013 |
7 | 1421534151 |
oct | 370770741 |
9 | 145731840 |
10 | 65270241 |
11 | 33930553 |
12 | 19a38169 |
13 | 106a3a5a |
14 | 8950761 |
15 | 5ae44e6 |
hex | 3e3f1e1 |
65270241 has 9 divisors (see below), whose sum is σ = 94314259. Its totient is φ = 43497336.
The previous prime is 65270207. The next prime is 65270299. The reversal of 65270241 is 14207256.
The square root of 65270241 is 8079.
It is a perfect power (a square), and thus also a powerful number.
65270241 is a `hidden beast` number, since 652 + 7 + 0 + 2 + 4 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 26780625 + 38489616 = 5175^2 + 6204^2 .
It is a tau number, because it is divible by the number of its divisors (9).
It is not a de Polignac number, because 65270241 - 219 = 64745953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65270201) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 22891 + ... + 25583.
Almost surely, 265270241 is an apocalyptic number.
65270241 is the 8079-th square number.
65270241 is the 4040-th centered octagonal number.
It is an amenable number.
65270241 is a deficient number, since it is larger than the sum of its proper divisors (29044018).
65270241 is an frugal number, since it uses more digits than its factorization.
65270241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5392 (or 2696 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The cubic root of 65270241 is about 402.6290182183.
Adding to 65270241 its reverse (14207256), we get a palindrome (79477497).
The spelling of 65270241 in words is "sixty-five million, two hundred seventy thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •