Search a number
-
+
106515166570 = 2510651516657
BaseRepresentation
bin110001100110011001…
…1000111010101101010
3101011221020002002121021
41203030303013111222
53221120340312240
6120533221403054
710460354656141
oct1431463072552
9334836062537
10106515166570
114119a04218a
121878786948a
13a0765409a7
145226452758
152b861d454a
hex18cccc756a

106515166570 has 8 divisors (see below), whose sum is σ = 191727299844. Its totient is φ = 42606066624.

The previous prime is 106515166559. The next prime is 106515166603. The reversal of 106515166570 is 75661515601.

It can be written as a sum of positive squares in 2 ways, for example, as 106072021969 + 443144601 = 325687^2 + 21051^2 .

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

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

It is an unprimeable number.

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

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

Almost surely, 2106515166570 is an apocalyptic number.

106515166570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 10651516664.

The product of its (nonzero) digits is 189000, while the sum is 43.

The spelling of 106515166570 in words is "one hundred six billion, five hundred fifteen million, one hundred sixty-six thousand, five hundred seventy".

Divisors: 1 2 5 10 10651516657 21303033314 53257583285 106515166570