Search a number
-
+
106680000 = 263547127
BaseRepresentation
bin1100101101111…
…00111011000000
321102201220110010
412112330323000
5204302230000
614330304520
72433523260
oct626747300
9242656403
10106680000
1155244299
122b888140
131914217b
141024d7a0
159573d50
hex65bcec0

106680000 has 280 divisors, whose sum is σ = 406269952. Its totient is φ = 24192000.

The previous prime is 106679933. The next prime is 106680001. The reversal of 106680000 is 86601.

It is a tau number, because it is divible by the number of its divisors (280).

It is a super-2 number, since 2×1066800002 = 22761244800000000, which contains 22 as substring.

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

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 839937 + ... + 840063.

Almost surely, 2106680000 is an apocalyptic number.

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

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

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

106680000 is an equidigital number, since it uses as much as digits as its factorization.

106680000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 288, while the sum is 21.

The square root of 106680000 is about 10328.6010669403. The cubic root of 106680000 is about 474.2722002937.

The spelling of 106680000 in words is "one hundred six million, six hundred eighty thousand".