Search a number
-
+
56255026035 = 3513733951881
BaseRepresentation
bin110100011001000011…
…111001001101110011
312101012111202102020210
4310121003321031303
51410202241313120
641502044235203
74031023555155
oct643103711563
9171174672223
1056255026035
112194854a75a
12aa9b83bb03
1353c691aa70
142a19366ad5
1516e3aa5ce0
hexd190f9373

56255026035 has 32 divisors (see below), whose sum is σ = 98259594048. Its totient is φ = 27315394560.

The previous prime is 56255026019. The next prime is 56255026039. The reversal of 56255026035 is 53062055265.

It is not a de Polignac number, because 56255026035 - 24 = 56255026019 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (39).

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

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

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

Almost surely, 256255026035 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3951975.

The product of its (nonzero) digits is 270000, while the sum is 39.

The spelling of 56255026035 in words is "fifty-six billion, two hundred fifty-five million, twenty-six thousand, thirty-five".

Divisors: 1 3 5 13 15 39 65 73 195 219 365 949 1095 2847 4745 14235 3951881 11855643 19759405 51374453 59278215 154123359 256872265 288487313 770616795 865461939 1442436565 3750335069 4327309695 11251005207 18751675345 56255026035