Search a number
-
+
100105560010561 = 721225136737671
BaseRepresentation
bin10110110000101110100100…
…010110000010111101000001
3111010102222221121002200011111
4112300232210112002331001
5101110112141330314221
6552523505344043321
730041250045342130
oct2660564426027501
9433388847080144
10100105560010561
1129995590974526
12b289165603541
1343b1bb581b061
141aa11c646b917
15b88e96bcebe1
hex5b0ba4582f41

100105560010561 has 8 divisors (see below), whose sum is σ = 114406425179264. Its totient is φ = 85804712562240.

The previous prime is 100105560010487. The next prime is 100105560010591. The reversal of 100105560010561 is 165010065501001.

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

It is not a de Polignac number, because 100105560010561 - 215 = 100105559977793 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (100105560010591) 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, 11488756 + ... + 18226426.

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

Almost surely, 2100105560010561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8860191.

The product of its (nonzero) digits is 4500, while the sum is 31.

The spelling of 100105560010561 in words is "one hundred trillion, one hundred five billion, five hundred sixty million, ten thousand, five hundred sixty-one".

Divisors: 1 7 2122513 6737671 14857591 47163697 14300794287223 100105560010561