Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0111011101010100110 |
3 | 101112012001221200001222 |
4 | 1212202132323222212 |
5 | 3300441122400402 |
6 | 122325045220342 |
7 | 10645246155014 |
oct | 1464236735246 |
9 | 345161850058 |
10 | 110100200102 |
11 | 42769768a12 |
12 | 194084016b2 |
13 | a4c81b07c9 |
14 | 54866278b4 |
15 | 2ce5cdb7a2 |
hex | 19a27bbaa6 |
110100200102 has 8 divisors (see below), whose sum is σ = 166611807576. Its totient is φ = 54562930912.
The previous prime is 110100200099. The next prime is 110100200107. The reversal of 110100200102 is 201002001011.
110100200102 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 110100200102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100200107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 243584288 + ... + 243584739.
It is an arithmetic number, because the mean of its divisors is an integer number (20826475947).
Almost surely, 2110100200102 is an apocalyptic number.
110100200102 is a deficient number, since it is larger than the sum of its proper divisors (56511607474).
110100200102 is a wasteful number, since it uses less digits than its factorization.
110100200102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487169142.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 110100200102 its reverse (201002001011), we get a palindrome (311102201113).
The spelling of 110100200102 in words is "one hundred ten billion, one hundred million, two hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •