Base | Representation |
---|---|
bin | 10111001111001101010110… |
… | …100111011111011001010111 |
3 | 111101212020120122210011200202 |
4 | 113033031112213133121113 |
5 | 101343422002200013421 |
6 | 1001210042420331115 |
7 | 30345502141445042 |
oct | 2717152647373127 |
9 | 441766518704622 |
10 | 102200200001111 |
11 | 2a622952601a33 |
12 | b567100243a9b |
13 | 450458c284124 |
14 | 1b34732165c59 |
15 | bc36dd57b10b |
hex | 5cf3569df657 |
102200200001111 has 8 divisors (see below), whose sum is σ = 102357774690000. Its totient is φ = 102042634256640.
The previous prime is 102200200001063. The next prime is 102200200001129. The reversal of 102200200001111 is 111100002002201.
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 102200200001111 - 230 = 102199126259287 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102200200001092 and 102200200001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102200200001161) 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, 20816840 + ... + 25253538.
It is an arithmetic number, because the mean of its divisors is an integer number (12794721836250).
Almost surely, 2102200200001111 is an apocalyptic number.
102200200001111 is a deficient number, since it is larger than the sum of its proper divisors (157574688889).
102200200001111 is an equidigital number, since it uses as much as digits as its factorization.
102200200001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4472209.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102200200001111 its reverse (111100002002201), we get a palindrome (213300202003312).
The spelling of 102200200001111 in words is "one hundred two trillion, two hundred billion, two hundred million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •