Search a number
-
+
56101005505061 = 1129175865221019
BaseRepresentation
bin11001100000110000010001…
…00000010011001000100101
321100122012111112101002220222
430300120020200103020211
524323124324402130221
6315152240210534125
714550110133520406
oct1460301040231045
9240565445332828
1056101005505061
111696a33706a460
126360901297345
13253c3c09a92ca
14dbd435bd99ad
156744b124e9ab
hex330608813225

56101005505061 has 8 divisors (see below), whose sum is σ = 63311479567200. Its totient is φ = 49242261885040.

The previous prime is 56101005505037. The next prime is 56101005505229. The reversal of 56101005505061 is 16050550010165.

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-56101005505061 is a prime.

It is a super-2 number, since 2×561010055050612 (a number of 28 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 (56101005505021) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87932610191 + ... + 87932610828.

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

Almost surely, 256101005505061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 175865221059.

The product of its (nonzero) digits is 22500, while the sum is 35.

The spelling of 56101005505061 in words is "fifty-six trillion, one hundred one billion, five million, five hundred five thousand, sixty-one".

Divisors: 1 11 29 319 175865221019 1934517431209 5100091409551 56101005505061