Base | Representation |
---|---|
bin | 11111000001011… |
… | …11101011101001 |
3 | 200010200200010021 |
4 | 33200233223221 |
5 | 1013110222103 |
6 | 41453520441 |
7 | 6310010323 |
oct | 1740575351 |
9 | 603620107 |
10 | 260242153 |
11 | 123999866 |
12 | 731a3121 |
13 | 41bba552 |
14 | 267c4613 |
15 | 17ca8bbd |
hex | f82fae9 |
260242153 has 4 divisors (see below), whose sum is σ = 263807188. Its totient is φ = 256677120.
The previous prime is 260242109. The next prime is 260242159. The reversal of 260242153 is 351242062.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 148157584 + 112084569 = 12172^2 + 10587^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-260242153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (260242159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1782408 + ... + 1782553.
It is an arithmetic number, because the mean of its divisors is an integer number (65951797).
Almost surely, 2260242153 is an apocalyptic number.
It is an amenable number.
260242153 is a deficient number, since it is larger than the sum of its proper divisors (3565035).
260242153 is an equidigital number, since it uses as much as digits as its factorization.
260242153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3565034.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 260242153 is about 16132.0225948267. The cubic root of 260242153 is about 638.4485148852.
Subtracting 260242153 from its reverse (351242062), we obtain a palindrome (90999909).
The spelling of 260242153 in words is "two hundred sixty million, two hundred forty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •