Base | Representation |
---|---|
bin | 100001011001011… |
… | …001010001011001 |
3 | 1110001022110021222 |
4 | 201121121101121 |
5 | 2121414231431 |
6 | 131333141425 |
7 | 16612341656 |
oct | 4131312131 |
9 | 1401273258 |
10 | 560305241 |
11 | 268306691 |
12 | 13778a875 |
13 | 8c10ac82 |
14 | 545b2c2d |
15 | 342cb57b |
hex | 21659459 |
560305241 has 12 divisors (see below), whose sum is σ = 580908132. Its totient is φ = 540237984.
The previous prime is 560305223. The next prime is 560305279. The reversal of 560305241 is 142503065.
It can be written as a sum of positive squares in 2 ways, for example, as 441168016 + 119137225 = 21004^2 + 10915^2 .
It is not a de Polignac number, because 560305241 - 26 = 560305177 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 560305241.
It is not an unprimeable number, because it can be changed into a prime (560365241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 182975 + ... + 186011.
It is an arithmetic number, because the mean of its divisors is an integer number (48409011).
Almost surely, 2560305241 is an apocalyptic number.
It is an amenable number.
560305241 is a deficient number, since it is larger than the sum of its proper divisors (20602891).
560305241 is an equidigital number, since it uses as much as digits as its factorization.
560305241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3208 (or 3149 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 560305241 is about 23670.7676470367. The cubic root of 560305241 is about 824.4067929082.
The spelling of 560305241 in words is "five hundred sixty million, three hundred five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •