Search a number
-
+
106601555615 = 521320311123
BaseRepresentation
bin110001101000111110…
…0101010011010011111
3101012011020122010002112
41203101330222122133
53221304444234430
6120545545144235
710462454162222
oct1432174523237
9335136563075
10106601555615
1141233887595
12187b078b07b
13a08b3ca179
145233add5b9
152b8da9b195
hex18d1f2a69f

106601555615 has 4 divisors (see below), whose sum is σ = 127921866744. Its totient is φ = 85281244488.

The previous prime is 106601555611. The next prime is 106601555633. The reversal of 106601555615 is 516555106601.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 516555106601 = 4710990534183.

It is a cyclic number.

It is not a de Polignac number, because 106601555615 - 22 = 106601555611 is a prime.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10660155557 + ... + 10660155566.

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

Almost surely, 2106601555615 is an apocalyptic number.

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

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

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

The sum of its prime factors is 21320311128.

The product of its (nonzero) digits is 135000, while the sum is 41.

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

Divisors: 1 5 21320311123 106601555615