Search a number
-
+
106705661516211 = 3929162011236323
BaseRepresentation
bin11000010000110001011001…
…000011001101100110110011
3111222210221222000111022010110
4120100301121003031212303
5102441231143322004321
61014535523145032403
731322141523444222
oct3020613103154663
9458727860438113
10106705661516211
1130aaa68712a13a
12bb74332185703
1347703ba858264
141c4c81dba4cb9
15c509d4886176
hex610c590cd9b3

106705661516211 has 16 divisors (see below), whose sum is σ = 142428844863360. Its totient is φ = 71059794520320.

The previous prime is 106705661516189. The next prime is 106705661516213. The reversal of 106705661516211 is 112615166507601.

It is not a de Polignac number, because 106705661516211 - 239 = 106155905702323 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (106705661516213) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 451406496 + ... + 451642818.

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

Almost surely, 2106705661516211 is an apocalyptic number.

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

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

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

The sum of its prime factors is 399266.

The product of its (nonzero) digits is 453600, while the sum is 48.

The spelling of 106705661516211 in words is "one hundred six trillion, seven hundred five billion, six hundred sixty-one million, five hundred sixteen thousand, two hundred eleven".

Divisors: 1 3 929 2787 162011 236323 486033 708969 150508219 219544067 451524657 658632201 38286925553 114860776659 35568553838737 106705661516211