Search a number
-
+
106422056335 = 5717334750651
BaseRepresentation
bin110001100011100111…
…1111011010110001111
3101011200201212121101001
41203013033323112033
53220423021300320
6120520054001131
710455144360550
oct1430717732617
9334621777331
10106422056335
1141151527081
12187606461a7
13a06017018a
145217d36327
152b7ce4120a
hex18c73fb58f

106422056335 has 32 divisors (see below), whose sum is σ = 147219835392. Its totient is φ = 72342787200.

The previous prime is 106422056311. The next prime is 106422056381. The reversal of 106422056335 is 533650224601.

It is not a de Polignac number, because 106422056335 - 219 = 106421532047 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 106422056294 and 106422056303.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2075760 + ... + 2126410.

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

Almost surely, 2106422056335 is an apocalyptic number.

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

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

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

The sum of its prime factors is 51183.

The product of its (nonzero) digits is 129600, while the sum is 37.

The spelling of 106422056335 in words is "one hundred six billion, four hundred twenty-two million, fifty-six thousand, three hundred thirty-five".

Divisors: 1 5 7 35 173 347 865 1211 1735 2429 6055 12145 50651 60031 253255 300155 354557 420217 1772785 2101085 8762623 17575897 43813115 61338361 87879485 123031279 306691805 615156395 3040630181 15203150905 21284411267 106422056335