Search a number
-
+
56705627135701 = 313372195424409
BaseRepresentation
bin11001110010010110011101…
…10000110001111011010101
321102210000010122122022210101
430321023032300301323111
524413031111021320301
6320334112214454101
714641563205551265
oct1471131660617325
9242700118568711
1056705627135701
11170827a3229505
126439b1b964331
132584418c884ab
1410007d1bab7a5
1568509bbd4701
hex3392cec31ed5

56705627135701 has 8 divisors (see below), whose sum is σ = 58535025286400. Its totient is φ = 54876240508320.

The previous prime is 56705627135609. The next prime is 56705627135711. The reversal of 56705627135701 is 10753172650765.

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

It is not a de Polignac number, because 56705627135701 - 217 = 56705627004629 is a prime.

It is a super-2 number, since 2×567056271357012 (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 (56705627135711) 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, 7741585 + ... + 13165993.

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

Almost surely, 256705627135701 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5761659.

The product of its (nonzero) digits is 9261000, while the sum is 55.

The spelling of 56705627135701 in words is "fifty-six trillion, seven hundred five billion, six hundred twenty-seven million, one hundred thirty-five thousand, seven hundred one".

Divisors: 1 31 337219 5424409 10453789 168156679 1829213778571 56705627135701