Search a number
-
+
56025109029 = 318675036343
BaseRepresentation
bin110100001011010110…
…110101001000100101
312100121111010102102010
4310023112311020211
51404214411442104
641423152304433
74022232366201
oct641326651045
9170544112363
1056025109029
112183a7936aa
12aa36842119
13538b0ba4b6
1429d69d7b01
1516cd7dc489
hexd0b5b5225

56025109029 has 4 divisors (see below), whose sum is σ = 74700145376. Its totient is φ = 37350072684.

The previous prime is 56025109013. The next prime is 56025109039. The reversal of 56025109029 is 92090152065.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 56025109029 - 24 = 56025109013 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 256025109029 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 18675036346.

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

The spelling of 56025109029 in words is "fifty-six billion, twenty-five million, one hundred nine thousand, twenty-nine".

Divisors: 1 3 18675036343 56025109029