Search a number
-
+
560506010055 = 3537367067337
BaseRepresentation
bin10000010100000001100…
…00101111100111000111
31222120202121221111021220
420022000300233213013
533140404014310210
61105254245011423
755331601322125
oct10120060574707
91876677844256
10560506010055
111a6789037392
12907683b3b73
1340b176857a4
141d1b2d94915
15e8a79d9c70
hex8280c2f9c7

560506010055 has 8 divisors (see below), whose sum is σ = 896809616112. Its totient is φ = 298936538688.

The previous prime is 560506009979. The next prime is 560506010059. The reversal of 560506010055 is 550010605065.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 560506010055 - 216 = 560505944519 is a prime.

It is a super-2 number, since 2×5605060100552 (a number of 24 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 560506009998 and 560506010025.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (560506010059) 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 7 ways as a sum of consecutive naturals, for example, 18683533654 + ... + 18683533683.

It is an arithmetic number, because the mean of its divisors is an integer number (112101202014).

Almost surely, 2560506010055 is an apocalyptic number.

560506010055 is a deficient number, since it is larger than the sum of its proper divisors (336303606057).

560506010055 is a wasteful number, since it uses less digits than its factorization.

560506010055 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 37367067345.

The product of its (nonzero) digits is 22500, while the sum is 33.

The spelling of 560506010055 in words is "five hundred sixty billion, five hundred six million, ten thousand, fifty-five".

Divisors: 1 3 5 15 37367067337 112101202011 186835336685 560506010055