Base | Representation |
---|---|
bin | 1101000000001… |
… | …00001110010000 |
3 | 21121020021211000 |
4 | 12200010032100 |
5 | 210410203300 |
6 | 14453422000 |
7 | 2463034002 |
oct | 640041620 |
9 | 247207730 |
10 | 109069200 |
11 | 56626339 |
12 | 3063a900 |
13 | 1979a7b6 |
14 | 106b2372 |
15 | 9896c00 |
hex | 6804390 |
109069200 has 120 divisors (see below), whose sum is σ = 388244000. Its totient is φ = 29082240.
The previous prime is 109069189. The next prime is 109069201. The reversal of 109069200 is 2960901.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (109069201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5751 + ... + 15849.
Almost surely, 2109069200 is an apocalyptic number.
109069200 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 109069200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194122000).
109069200 is an abundant number, since it is smaller than the sum of its proper divisors (279174800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109069200 is a wasteful number, since it uses less digits than its factorization.
109069200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10126 (or 10109 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The square root of 109069200 is about 10443.6200620283. The cubic root of 109069200 is about 477.7866849290.
The spelling of 109069200 in words is "one hundred nine million, sixty-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •