Search a number
-
+
56000000065 = 5293122954403
BaseRepresentation
bin110100001001110111…
…000011000001000001
312100112201212202101111
4310021313003001001
51404142000000230
641420454203321
74021506101212
oct641167030101
9170481782344
1056000000065
11218275a3999
12aa2a353541
135385b38819
1429d353d409
1516cb4cc92a
hexd09dc3041

56000000065 has 32 divisors (see below), whose sum is σ = 72074419200. Its totient is φ = 41676284160.

The previous prime is 56000000039. The next prime is 56000000093.

56000000065 is nontrivially palindromic in base 10.

It is a de Polignac number, because none of the positive numbers 2k-56000000065 is a prime.

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1002154 + ... + 1056556.

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

Almost surely, 256000000065 is an apocalyptic number.

It is an amenable number.

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

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

56000000065 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 54697.

The product of its (nonzero) digits is 900, while the sum is 22.

It can be divided in two parts, 560000000 and 65, that added together give a palindrome (560000065).

The spelling of 56000000065 in words is "fifty-six billion, sixty-five", and thus it is an aban number and an uban number.

Divisors: 1 5 29 31 145 155 229 899 1145 4495 6641 7099 33205 35495 54403 205871 272015 1029355 1577687 1686493 7888435 8432465 12458287 48908297 62291435 244541485 361290323 386206897 1806451615 1931034485 11200000013 56000000065