Base | Representation |
---|---|
bin | 11001010011111011111101… |
… | …110001100011000101000001 |
3 | 112121011012112020002000212102 |
4 | 121103323331301203011001 |
5 | 104042341324310031423 |
6 | 1032432132405440145 |
7 | 32306456415321512 |
oct | 3123737561430501 |
9 | 477135466060772 |
10 | 111321220002113 |
11 | 3251a07860a010 |
12 | 1059a96b410055 |
13 | 4a1671374c064 |
14 | 1d6bd9382aa09 |
15 | cd0ac1540c28 |
hex | 653efdc63141 |
111321220002113 has 4 divisors (see below), whose sum is σ = 121441330911408. Its totient is φ = 101201109092820.
The previous prime is 111321220002107. The next prime is 111321220002163. The reversal of 111321220002113 is 311200022123111.
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 not a de Polignac number, because 111321220002113 - 224 = 111321203224897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111321220002163) 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, 5060055454631 + ... + 5060055454652.
It is an arithmetic number, because the mean of its divisors is an integer number (30360332727852).
Almost surely, 2111321220002113 is an apocalyptic number.
It is an amenable number.
111321220002113 is a deficient number, since it is larger than the sum of its proper divisors (10120110909295).
111321220002113 is a wasteful number, since it uses less digits than its factorization.
111321220002113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10120110909294.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 111321220002113 its reverse (311200022123111), we get a palindrome (422521242125224).
The spelling of 111321220002113 in words is "one hundred eleven trillion, three hundred twenty-one billion, two hundred twenty million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •