Search a number
-
+
56010055051 = 157356751943
BaseRepresentation
bin110100001010011101…
…011001110110001011
312100120102210121020101
4310022131121312023
51404202033230201
641421453510231
74021660420066
oct641235316613
9170512717211
1056010055051
11218322413a5
12aa317a2377
135387c49412
1429d49d98dd
1516cc316d01
hexd0a759d8b

56010055051 has 4 divisors (see below), whose sum is σ = 56366807152. Its totient is φ = 55653302952.

The previous prime is 56010055019. The next prime is 56010055093. The reversal of 56010055051 is 15055001065.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 56010055051 - 25 = 56010055019 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 256010055051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 356752100.

The product of its (nonzero) digits is 3750, while the sum is 28.

The spelling of 56010055051 in words is "fifty-six billion, ten million, fifty-five thousand, fifty-one".

Divisors: 1 157 356751943 56010055051