Search a number
-
+
101056100605 = 555760759779
BaseRepresentation
bin101111000011101101…
…0011011100011111101
3100122211202212210220221
41132013122123203331
53123430330204410
6114231410541341
710205156453005
oct1360732334375
9318752783827
10101056100605
1139948597119
1217703597851
1396b655ca45
144c69413005
152966ced4da
hex178769b8fd

101056100605 has 16 divisors (see below), whose sum is σ = 121687211520. Its totient is φ = 80565440832.

The previous prime is 101056100597. The next prime is 101056100633. The reversal of 101056100605 is 506001650101.

It is a cyclic number.

It is not a de Polignac number, because 101056100605 - 23 = 101056100597 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 101056100605.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1660606 + ... + 1720384.

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

Almost surely, 2101056100605 is an apocalyptic number.

It is an amenable number.

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

101056100605 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 60948.

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

Adding to 101056100605 its reverse (506001650101), we get a palindrome (607057750706).

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

Divisors: 1 5 557 607 2785 3035 59779 298895 338099 1690495 33296903 36285853 166484515 181429265 20211220121 101056100605