Search a number
-
+
56653020131 = 716569121469
BaseRepresentation
bin110100110000110010…
…000111101111100011
312102020020122121111212
4310300302013233203
51412011133121011
642005342500335
74043625503621
oct646062075743
9172206577455
1056653020131
11220321755a4
12ab90b946ab
13545b209326
142a56168511
1517189c008b
hexd30c87be3

56653020131 has 8 divisors (see below), whose sum is σ = 57460168800. Its totient is φ = 55846127680.

The previous prime is 56653020121. The next prime is 56653020143. The reversal of 56653020131 is 13102035665.

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

It is a cyclic number.

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

It is a super-2 number, since 2×566530201312 (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 (56653020121) 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 7 ways as a sum of consecutive naturals, for example, 405665 + ... + 527133.

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

Almost surely, 256653020131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 128109.

The product of its (nonzero) digits is 16200, while the sum is 32.

Adding to 56653020131 its reverse (13102035665), we get a palindrome (69755055796).

The spelling of 56653020131 in words is "fifty-six billion, six hundred fifty-three million, twenty thousand, one hundred thirty-one".

Divisors: 1 71 6569 121469 466399 8624299 797929861 56653020131