Search a number
-
+
106570195200 = 2832527534987
BaseRepresentation
bin110001101000000010…
…1000010000100000000
3101012002001121211200200
41203100011002010000
53221223432221300
6120542505045200
710461623466360
oct1432005020400
9335061554620
10106570195200
1141218107a97
12187a2186800
13a084a69c01
14522d8989a0
152b8ae54200
hex18d0142100

106570195200 has 648 divisors, whose sum is σ = 443747723328. Its totient is φ = 23894507520.

The previous prime is 106570195189. The next prime is 106570195213. The reversal of 106570195200 is 2591075601.

106570195200 is a `hidden beast` number, since 1 + 0 + 65 + 70 + 1 + 9 + 520 + 0 = 666.

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

It is a Harshad number since it is a multiple of its sum of digits (36).

It is an unprimeable number.

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 21367107 + ... + 21372093.

Almost surely, 2106570195200 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 18900, while the sum is 36.

The spelling of 106570195200 in words is "one hundred six billion, five hundred seventy million, one hundred ninety-five thousand, two hundred".