Base | Representation |
---|---|
bin | 1010001100101100000101… |
… | …1111111101001000100001 |
3 | 1110200221222222122021222102 |
4 | 2203023001133331020201 |
5 | 2432203422410201423 |
6 | 35503122044220145 |
7 | 2235056226034520 |
oct | 243130137751041 |
9 | 43627888567872 |
10 | 11213111022113 |
11 | 36334a9935080 |
12 | 131121423a655 |
13 | 634512b17580 |
14 | 2aaa08a424b7 |
15 | 146a2abb0c28 |
hex | a32c17fd221 |
11213111022113 has 16 divisors (see below), whose sum is σ = 15055365849216. Its totient is φ = 8065374560640.
The previous prime is 11213111022007. The next prime is 11213111022131. The reversal of 11213111022113 is 31122011131211.
It is a cyclic number.
It is not a de Polignac number, because 11213111022113 - 28 = 11213111021857 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11213111022193) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5600953556 + ... + 5600955557.
It is an arithmetic number, because the mean of its divisors is an integer number (940960365576).
Almost surely, 211213111022113 is an apocalyptic number.
11213111022113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11213111022113 is a deficient number, since it is larger than the sum of its proper divisors (3842254827103).
11213111022113 is a wasteful number, since it uses less digits than its factorization.
11213111022113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11201909144.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 11213111022113 its reverse (31122011131211), we get a palindrome (42335122153324).
The spelling of 11213111022113 in words is "eleven trillion, two hundred thirteen billion, one hundred eleven million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •