Base | Representation |
---|---|
bin | 1100101110110… |
… | …11000000000000 |
3 | 21102222011110002 |
4 | 12113123000000 |
5 | 204320200300 |
6 | 14333055132 |
7 | 2434545410 |
oct | 627330000 |
9 | 242864402 |
10 | 106803200 |
11 | 55318909 |
12 | 2b9274a8 |
13 | 1918627a |
14 | 10282640 |
15 | 959a5d5 |
hex | 65db000 |
106803200 has 156 divisors (see below), whose sum is σ = 304705200. Its totient is φ = 36372480.
The previous prime is 106803187. The next prime is 106803209. The reversal of 106803200 is 2308601.
It is a super-2 number, since 2×1068032002 = 22813847060480000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (106803209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 716726 + ... + 716874.
Almost surely, 2106803200 is an apocalyptic number.
106803200 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 106803200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152352600).
106803200 is an abundant number, since it is smaller than the sum of its proper divisors (197902000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106803200 is an equidigital number, since it uses as much as digits as its factorization.
106803200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190 (or 163 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 106803200 is about 10334.5633676513. The cubic root of 106803200 is about 474.4547020330.
The spelling of 106803200 in words is "one hundred six million, eight hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •