Base | Representation |
---|---|
bin | 11001010000101111110100… |
… | …011011111100000001110101 |
3 | 112120101020201210121200202202 |
4 | 121100233310123330001311 |
5 | 104030243414110310401 |
6 | 1032143321405114245 |
7 | 32254566425166431 |
oct | 3120576433740165 |
9 | 476336653550682 |
10 | 111102020010101 |
11 | 3244511396571a |
12 | 10564395858985 |
13 | 49cbb4c70b983 |
14 | 1d6151b7d19c1 |
15 | cca0426ca06b |
hex | 650bf46fc075 |
111102020010101 has 4 divisors (see below), whose sum is σ = 111105015760512. Its totient is φ = 111099024259692.
The previous prime is 111102020010061. The next prime is 111102020010139. The reversal of 111102020010101 is 101010020201111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111102020010101 - 210 = 111102020009077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111102020010181) 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, 1497819575 + ... + 1497893748.
It is an arithmetic number, because the mean of its divisors is an integer number (27776253940128).
Almost surely, 2111102020010101 is an apocalyptic number.
It is an amenable number.
111102020010101 is a deficient number, since it is larger than the sum of its proper divisors (2995750411).
111102020010101 is an equidigital number, since it uses as much as digits as its factorization.
111102020010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2995750410.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 111102020010101 its reverse (101010020201111), we get a palindrome (212112040211212).
The spelling of 111102020010101 in words is "one hundred eleven trillion, one hundred two billion, twenty million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •