Base | Representation |
---|---|
bin | 1101000111001… |
… | …11100001001000 |
3 | 21122222120220111 |
4 | 12203213201020 |
5 | 211130001300 |
6 | 14525404104 |
7 | 2503662202 |
oct | 643474110 |
9 | 248876814 |
10 | 110000200 |
11 | 57101862 |
12 | 30a09634 |
13 | 19a3549b |
14 | 10875772 |
15 | 99cc9ba |
hex | 68e7848 |
110000200 has 48 divisors (see below), whose sum is σ = 270802980. Its totient is φ = 41410560.
The previous prime is 110000197. The next prime is 110000201. The reversal of 110000200 is 2000011.
It can be written as a sum of positive squares in 6 ways, for example, as 78393316 + 31606884 = 8854^2 + 5622^2 .
It is a Harshad number since it is a multiple of its sum of digits (4).
It is a self number, because there is not a number n which added to its sum of digits gives 110000200.
It is not an unprimeable number, because it can be changed into a prime (110000201) 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, 12777 + ... + 19576.
Almost surely, 2110000200 is an apocalyptic number.
110000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110000200 is an abundant number, since it is smaller than the sum of its proper divisors (160802780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110000200 is a wasteful number, since it uses less digits than its factorization.
110000200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32386 (or 32377 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 4.
The square root of 110000200 is about 10488.0980163231. The cubic root of 110000200 is about 479.1422760952.
Adding to 110000200 its reverse (2000011), we get a palindrome (112000211).
The spelling of 110000200 in words is "one hundred ten million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •