Base | Representation |
---|---|
bin | 101111100101110011… |
… | …0110100101101000111 |
3 | 100202210111201002020212 |
4 | 1133023212310231013 |
5 | 3133301222400012 |
6 | 114541120550035 |
7 | 10245421236533 |
oct | 1371346645507 |
9 | 322714632225 |
10 | 102200200007 |
11 | 3a385391a14 |
12 | 1798278231b |
13 | 98395b1139 |
14 | 4d37350bc3 |
15 | 29d2495b22 |
hex | 17cb9b4b47 |
102200200007 has 8 divisors (see below), whose sum is σ = 108684522000. Its totient is φ = 95768383104.
The previous prime is 102200200001. The next prime is 102200200049. The reversal of 102200200007 is 700002002201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102200200007 - 214 = 102200183623 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102200199964 and 102200200000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102200200001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13122257 + ... + 13130042.
It is an arithmetic number, because the mean of its divisors is an integer number (13585565250).
Almost surely, 2102200200007 is an apocalyptic number.
102200200007 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
102200200007 is a deficient number, since it is larger than the sum of its proper divisors (6484321993).
102200200007 is a wasteful number, since it uses less digits than its factorization.
102200200007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26252545.
The product of its (nonzero) digits is 56, while the sum is 14.
Adding to 102200200007 its reverse (700002002201), we get a palindrome (802202202208).
The spelling of 102200200007 in words is "one hundred two billion, two hundred million, two hundred thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •