Base | Representation |
---|---|
bin | 11111100110110… |
… | …11101110010101 |
3 | 200110220120021021 |
4 | 33303123232111 |
5 | 1020334004031 |
6 | 42150521141 |
7 | 6366443146 |
oct | 1763335625 |
9 | 613816237 |
10 | 265141141 |
11 | 126735511 |
12 | 749661b1 |
13 | 42c14365 |
14 | 272dbacd |
15 | 18425511 |
hex | fcdbb95 |
265141141 has 4 divisors (see below), whose sum is σ = 265194412. Its totient is φ = 265087872.
The previous prime is 265141111. The next prime is 265141157. The reversal of 265141141 is 141141562.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141141562 = 2 ⋅70570781.
It can be written as a sum of positive squares in 2 ways, for example, as 142706916 + 122434225 = 11946^2 + 11065^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-265141141 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 (265141111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18300 + ... + 29413.
It is an arithmetic number, because the mean of its divisors is an integer number (66298603).
Almost surely, 2265141141 is an apocalyptic number.
It is an amenable number.
265141141 is a deficient number, since it is larger than the sum of its proper divisors (53271).
265141141 is an equidigital number, since it uses as much as digits as its factorization.
265141141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53270.
The product of its digits is 960, while the sum is 25.
The square root of 265141141 is about 16283.1551303794. The cubic root of 265141141 is about 642.4298427031.
The spelling of 265141141 in words is "two hundred sixty-five million, one hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •