Base | Representation |
---|---|
bin | 10000010100111000110… |
… | …00111110101100101001 |
3 | 1222121221221011101012001 |
4 | 20022130120332230221 |
5 | 33142331200324231 |
6 | 1105412244051001 |
7 | 55346230302400 |
oct | 10123430765451 |
9 | 1877857141161 |
10 | 560969542441 |
11 | 1a69a6756100 |
12 | 90877693a61 |
13 | 40b8c70cac9 |
14 | 1d218776637 |
15 | e8d354cb61 |
hex | 829c63eb29 |
560969542441 has 81 divisors (see below), whose sum is σ = 732866573271. Its totient is φ = 427816804800.
The previous prime is 560969542433. The next prime is 560969542447. The reversal of 560969542441 is 144245969065.
The square root of 560969542441 is 748979.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 329516181225 + 231453361216 = 574035^2 + 481096^2 .
It is not a de Polignac number, because 560969542441 - 23 = 560969542433 is a prime.
It is not an unprimeable number, because it can be changed into a prime (560969542447) 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 80 ways as a sum of consecutive naturals, for example, 4094668125 + ... + 4094668261.
Almost surely, 2560969542441 is an apocalyptic number.
560969542441 is the 748979-th square number.
560969542441 is the 374490-th centered octagonal number.
It is an amenable number.
560969542441 is a deficient number, since it is larger than the sum of its proper divisors (171897030830).
560969542441 is an equidigital number, since it uses as much as digits as its factorization.
560969542441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452 (or 226 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 55.
The spelling of 560969542441 in words is "five hundred sixty billion, nine hundred sixty-nine million, five hundred forty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •