Base | Representation |
---|---|
bin | 1010000110111000010001… |
… | …0111010111010101000011 |
3 | 1110100102101001200112012202 |
4 | 2201232010113113111003 |
5 | 2424040020041042011 |
6 | 35345214031343415 |
7 | 2224623650560361 |
oct | 241560427272503 |
9 | 43312331615182 |
10 | 11113301112131 |
11 | 35a5140833469 |
12 | 12b59ba081b6b |
13 | 627c9780253a |
14 | 2a5c5ad44631 |
15 | 1441384c423b |
hex | a1b845d7543 |
11113301112131 has 4 divisors (see below), whose sum is σ = 11698211697000. Its totient is φ = 10528390527264.
The previous prime is 11113301112041. The next prime is 11113301112163. The reversal of 11113301112131 is 13121110331111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11113301112131 is a prime.
It is a super-2 number, since 2×111133011121312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11113301112031) 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, 292455292406 + ... + 292455292443.
It is an arithmetic number, because the mean of its divisors is an integer number (2924552924250).
Almost surely, 211113301112131 is an apocalyptic number.
11113301112131 is a deficient number, since it is larger than the sum of its proper divisors (584910584869).
11113301112131 is an equidigital number, since it uses as much as digits as its factorization.
11113301112131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584910584868.
The product of its (nonzero) digits is 54, while the sum is 20.
Adding to 11113301112131 its reverse (13121110331111), we get a palindrome (24234411443242).
The spelling of 11113301112131 in words is "eleven trillion, one hundred thirteen billion, three hundred one million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.259 sec. • engine limits •