Search a number
-
+
106066515720 = 233511234677481
BaseRepresentation
bin110001011001000001…
…1101001011100001000
3101010202221212021100010
41202302003221130020
53214211012000340
6120420513311520
710443266336154
oct1426203513410
9333687767303
10106066515720
1140a89868160
12186815655a0
13a0045c7109
1451c2a26064
152b5bb10b80
hex18b20e9708

106066515720 has 256 divisors, whose sum is σ = 363043399680. Its totient is φ = 24539187200.

The previous prime is 106066515713. The next prime is 106066515721. The reversal of 106066515720 is 27515660601.

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14174380 + ... + 14181860.

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

Almost surely, 2106066515720 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 106066515720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181521699840).

106066515720 is an abundant number, since it is smaller than the sum of its proper divisors (256976883960).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 7996 (or 7992 counting only the distinct ones).

The product of its (nonzero) digits is 75600, while the sum is 39.

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