Search a number
-
+
106951650805 = 521390330161
BaseRepresentation
bin110001110011011010…
…0001010110111110101
3101020001122101210102001
41203212310022313311
53223014110311210
6121044413015301
710504235014006
oct1434664126765
9336048353361
10106951650805
11413a346725a
1218889a84531
13a115ab779c
1452683d31ad
152bae6a303a
hex18e6d0adf5

106951650805 has 4 divisors (see below), whose sum is σ = 128341980972. Its totient is φ = 85561320640.

The previous prime is 106951650791. The next prime is 106951650821. The reversal of 106951650805 is 508056159601.

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

It can be written as a sum of positive squares in 2 ways, for example, as 49838776516 + 57112874289 = 223246^2 + 238983^2 .

It is not a de Polignac number, because 106951650805 - 29 = 106951650293 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2106951650805 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 21390330166.

The product of its (nonzero) digits is 324000, while the sum is 46.

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

Divisors: 1 5 21390330161 106951650805