Base | Representation |
---|---|
bin | 10111001100010011000101… |
… | …101100011011000011011111 |
3 | 111101011010100022200121202002 |
4 | 113030103011230123003133 |
5 | 101332132402211231421 |
6 | 1000534124532352515 |
7 | 30325162021401353 |
oct | 2714230554330337 |
9 | 441133308617662 |
10 | 102000200102111 |
11 | 2a5560508aa703 |
12 | b5343a477573b |
13 | 44bb767c9bc1c |
14 | 1b28b9c0ad463 |
15 | bbd3d5126b0b |
hex | 5cc4c5b1b0df |
102000200102111 has 4 divisors (see below), whose sum is σ = 102273659083992. Its totient is φ = 101726741120232.
The previous prime is 102000200102063. The next prime is 102000200102153. The reversal of 102000200102111 is 111201002000201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102000200102111 - 222 = 102000195907807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102000200102092 and 102000200102101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102000200132111) 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, 136729490381 + ... + 136729491126.
It is an arithmetic number, because the mean of its divisors is an integer number (25568414770998).
Almost surely, 2102000200102111 is an apocalyptic number.
102000200102111 is a deficient number, since it is larger than the sum of its proper divisors (273458981881).
102000200102111 is an equidigital number, since it uses as much as digits as its factorization.
102000200102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273458981880.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102000200102111 its reverse (111201002000201), we get a palindrome (213201202102312).
The spelling of 102000200102111 in words is "one hundred two trillion, two hundred million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •