Search a number
-
+
106515110001 = 3144899245033
BaseRepresentation
bin110001100110011001…
…0111001100001110001
3101011221012222020000010
41203030302321201301
53221120332010001
6120533220245133
710460354332206
oct1431462714161
9334835866003
10106515110001
114119a003733
12187878407a9
13a076521011
145226439cad
152b861c28d6
hex18cccb9871

106515110001 has 8 divisors (see below), whose sum is σ = 142021706400. Its totient is φ = 71009293472.

The previous prime is 106515109979. The next prime is 106515110029. The reversal of 106515110001 is 100011515601.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 106515110001 - 29 = 106515109489 is a prime.

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

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

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

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

Almost surely, 2106515110001 is an apocalyptic number.

It is an amenable number.

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

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

106515110001 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 389935.

The product of its (nonzero) digits is 150, while the sum is 21.

Adding to 106515110001 its reverse (100011515601), we get a palindrome (206526625602).

The spelling of 106515110001 in words is "one hundred six billion, five hundred fifteen million, one hundred ten thousand, one".

Divisors: 1 3 144899 245033 434697 735099 35505036667 106515110001