Base | Representation |
---|---|
bin | 101111100101110011… |
… | …0011100110011011110 |
3 | 100202210111112002222001 |
4 | 1133023212130303132 |
5 | 3133301211231420 |
6 | 114541114512514 |
7 | 10245420351241 |
oct | 1371346346336 |
9 | 322714462861 |
10 | 102200102110 |
11 | 3a385325407 |
12 | 1798273573a |
13 | 9839578702 |
14 | 4d37327258 |
15 | 29d2476b0a |
hex | 17cb99ccde |
102200102110 has 32 divisors (see below), whose sum is σ = 187758518400. Its totient is φ = 40041576960.
The previous prime is 102200102083. The next prime is 102200102129. The reversal of 102200102110 is 11201002201.
102200102110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 204715 + ... + 496294.
It is an arithmetic number, because the mean of its divisors is an integer number (5867453700).
Almost surely, 2102200102110 is an apocalyptic number.
102200102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102200102110 is a deficient number, since it is larger than the sum of its proper divisors (85558416290).
102200102110 is a wasteful number, since it uses less digits than its factorization.
102200102110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701316.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 102200102110 its reverse (11201002201), we get a palindrome (113401104311).
Subtracting from 102200102110 its reverse (11201002201), we obtain a palindrome (90999099909).
The spelling of 102200102110 in words is "one hundred two billion, two hundred million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •