Base | Representation |
---|---|
bin | 110011010100001110… |
… | …0011001110000001000 |
3 | 101112110001010012102022 |
4 | 1212220130121300020 |
5 | 3301142222401300 |
6 | 122343020424012 |
7 | 10650602150336 |
oct | 1465034316010 |
9 | 345401105368 |
10 | 110200200200 |
11 | 4281015a522 |
12 | 194359a8008 |
13 | a512b2436c |
14 | 5495a18b56 |
15 | 2cee991285 |
hex | 19a8719c08 |
110200200200 has 48 divisors (see below), whose sum is σ = 256532548500. Its totient is φ = 44025528320.
The previous prime is 110200200161. The next prime is 110200200251. The reversal of 110200200200 is 2002002011.
It can be written as a sum of positive squares in 6 ways, for example, as 23621845636 + 86578354564 = 153694^2 + 294242^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
110200200200 is a modest number, since divided by 200200 gives 110200 as remainder.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 178745 + ... + 502344.
Almost surely, 2110200200200 is an apocalyptic number.
110200200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110200200200 is an abundant number, since it is smaller than the sum of its proper divisors (146332348300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200200200 is a wasteful number, since it uses less digits than its factorization.
110200200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681914 (or 681905 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 110200200200 its reverse (2002002011), we get a palindrome (112202202211).
It can be divided in two parts, 1 and 10200200200, that added together give a palindrome (10200200201).
The spelling of 110200200200 in words is "one hundred ten billion, two hundred million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •