Base | Representation |
---|---|
bin | 10111001111001101010001… |
… | …010100110010001000000011 |
3 | 111101212020100110201011120112 |
4 | 113033031101110302020003 |
5 | 101343421311432223021 |
6 | 1001210025525301535 |
7 | 30345500012651552 |
oct | 2717152124621003 |
9 | 441766313634515 |
10 | 102200111211011 |
11 | 2a622907477690 |
12 | b5670965648ab |
13 | 4504576a66ac8 |
14 | 1b34724451d99 |
15 | bc36d588cd5b |
hex | 5cf351532203 |
102200111211011 has 4 divisors (see below), whose sum is σ = 111491030412024. Its totient is φ = 92909192010000.
The previous prime is 102200111210971. The next prime is 102200111211083. The reversal of 102200111211011 is 110112111002201.
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 102200111211011 - 238 = 101925233304067 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102200111210011) 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, 4645459600490 + ... + 4645459600511.
It is an arithmetic number, because the mean of its divisors is an integer number (27872757603006).
Almost surely, 2102200111211011 is an apocalyptic number.
102200111211011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102200111211011 is a deficient number, since it is larger than the sum of its proper divisors (9290919201013).
102200111211011 is an equidigital number, since it uses as much as digits as its factorization.
102200111211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9290919201012.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102200111211011 its reverse (110112111002201), we get a palindrome (212312222213212).
The spelling of 102200111211011 in words is "one hundred two trillion, two hundred billion, one hundred eleven million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •