Base | Representation |
---|---|
bin | 11111101000111… |
… | …00001010000101 |
3 | 200111101222022002 |
4 | 33310130022011 |
5 | 1020420430221 |
6 | 42200315045 |
7 | 6401622455 |
oct | 1764341205 |
9 | 614358262 |
10 | 265405061 |
11 | 1268a5829 |
12 | 74a72a85 |
13 | 42ca751c |
14 | 27369d65 |
15 | 1847880b |
hex | fd1c285 |
265405061 has 4 divisors (see below), whose sum is σ = 265440300. Its totient is φ = 265369824.
The previous prime is 265405051. The next prime is 265405103. The reversal of 265405061 is 160504562.
265405061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It can be written as a sum of positive squares in 2 ways, for example, as 139830625 + 125574436 = 11825^2 + 11206^2 .
It is a cyclic number.
It is not a de Polignac number, because 265405061 - 222 = 261210757 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 (265405051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1256 + ... + 23073.
It is an arithmetic number, because the mean of its divisors is an integer number (66360075).
Almost surely, 2265405061 is an apocalyptic number.
It is an amenable number.
265405061 is a deficient number, since it is larger than the sum of its proper divisors (35239).
265405061 is a wasteful number, since it uses less digits than its factorization.
265405061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35238.
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 265405061 is about 16291.2571951952. The cubic root of 265405061 is about 642.6429290341.
The spelling of 265405061 in words is "two hundred sixty-five million, four hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •