Base | Representation |
---|---|
bin | 11001001111100101011000… |
… | …110101010011000101001101 |
3 | 112120002121110001000120210102 |
4 | 121033211120311103011031 |
5 | 104022441230100013401 |
6 | 1032042503150020445 |
7 | 32246040064262642 |
oct | 3117453065230515 |
9 | 476077401016712 |
10 | 111022100001101 |
11 | 32414232124003 |
12 | 105509b07a7725 |
13 | 49c4454033113 |
14 | 1d5b6d9519dc9 |
15 | cc7e1625c56b |
hex | 64f958d5314d |
111022100001101 has 4 divisors (see below), whose sum is σ = 111027880313952. Its totient is φ = 111016319688252.
The previous prime is 111022100001097. The next prime is 111022100001133. The reversal of 111022100001101 is 101100001220111.
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 111022100001101 - 22 = 111022100001097 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 (111022100001401) 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, 2890127615 + ... + 2890166028.
It is an arithmetic number, because the mean of its divisors is an integer number (27756970078488).
Almost surely, 2111022100001101 is an apocalyptic number.
It is an amenable number.
111022100001101 is a deficient number, since it is larger than the sum of its proper divisors (5780312851).
111022100001101 is an equidigital number, since it uses as much as digits as its factorization.
111022100001101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5780312850.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 111022100001101 its reverse (101100001220111), we get a palindrome (212122101221212).
The spelling of 111022100001101 in words is "one hundred eleven trillion, twenty-two billion, one hundred million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •