Search a number
-
+
106721205665 = 5101632100191
BaseRepresentation
bin110001101100100010…
…1000101110110100001
3101012110120202222002212
41203121011011312201
53222031112040130
6121005501451505
710465436165204
oct1433105056641
9335416688085
10106721205665
114129537a428
1218824870b95
13a0aa130a09
14524596793b
152b99332e95
hex18d9145da1

106721205665 has 8 divisors (see below), whose sum is σ = 128078108928. Its totient is φ = 85368523120.

The previous prime is 106721205641. The next prime is 106721205673. The reversal of 106721205665 is 566502127601.

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

It is not a de Polignac number, because 106721205665 - 210 = 106721204641 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 999281 + ... + 1100910.

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

Almost surely, 2106721205665 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2110359.

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

The spelling of 106721205665 in words is "one hundred six billion, seven hundred twenty-one million, two hundred five thousand, six hundred sixty-five".

Divisors: 1 5 10163 50815 2100191 10500955 21344241133 106721205665