Search a number
-
+
106500651540 = 223529833492113
BaseRepresentation
bin110001100101111101…
…1101111101000010100
3101011220012202122201120
41203023323233220110
53221103131322130
6120531542323540
710460120413233
oct1431373575024
9334805678646
10106500651540
1141191928898
1218782a295b0
13a07352b00a
145224554b1a
152b84cb8910
hex18cbeefa14

106500651540 has 192 divisors, whose sum is σ = 313244064000. Its totient is φ = 27000078336.

The previous prime is 106500651539. The next prime is 106500651571. The reversal of 106500651540 is 45156005601.

It is a super-3 number, since 3×1065006515403 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2106500651540 is an apocalyptic number.

106500651540 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 106500651540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156622032000).

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

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

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

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

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

The product of its (nonzero) digits is 18000, while the sum is 33.

The spelling of 106500651540 in words is "one hundred six billion, five hundred million, six hundred fifty-one thousand, five hundred forty".