Base | Representation |
---|---|
bin | 100001011001110… |
… | …101110010100101 |
3 | 1110001112101112100 |
4 | 201121311302211 |
5 | 2121432001203 |
6 | 131335442313 |
7 | 16613336352 |
oct | 4131656245 |
9 | 1401471470 |
10 | 560422053 |
11 | 268386424 |
12 | 137826399 |
13 | 8c14c1a9 |
14 | 54603629 |
15 | 34300ea3 |
hex | 21675ca5 |
560422053 has 48 divisors (see below), whose sum is σ = 856215360. Its totient is φ = 352864512.
The previous prime is 560421997. The next prime is 560422087. The reversal of 560422053 is 350224065.
560422053 is a `hidden beast` number, since 5 + 604 + 2 + 2 + 0 + 53 = 666.
560422053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-560422053 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (560421053) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1825326 + ... + 1825632.
It is an arithmetic number, because the mean of its divisors is an integer number (17837820).
Almost surely, 2560422053 is an apocalyptic number.
560422053 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
560422053 is a deficient number, since it is larger than the sum of its proper divisors (295793307).
560422053 is a wasteful number, since it uses less digits than its factorization.
560422053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498 (or 495 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 560422053 is about 23673.2349500443. The cubic root of 560422053 is about 824.4640794893.
The spelling of 560422053 in words is "five hundred sixty million, four hundred twenty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •