Base | Representation |
---|---|
bin | 1010000110110111101000… |
… | …1111001101000111111111 |
3 | 1110100101221012222010222202 |
4 | 2201231322033031013333 |
5 | 2424034143041413043 |
6 | 35345145121502115 |
7 | 2224616515421615 |
oct | 241557217150777 |
9 | 43311835863882 |
10 | 11113131201023 |
11 | 35a5063931765 |
12 | 12b59711a193b |
13 | 627c6b551817 |
14 | 2a5c425556b5 |
15 | 1441286101b8 |
hex | a1b7a3cd1ff |
11113131201023 has 4 divisors (see below), whose sum is σ = 11114261858040. Its totient is φ = 11112000544008.
The previous prime is 11113131200999. The next prime is 11113131201113. The reversal of 11113131201023 is 32010213131111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11113131201023 - 212 = 11113131196927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11113131200986 and 11113131201004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11113131200023) 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, 565313765 + ... + 565333422.
It is an arithmetic number, because the mean of its divisors is an integer number (2778565464510).
Almost surely, 211113131201023 is an apocalyptic number.
11113131201023 is a deficient number, since it is larger than the sum of its proper divisors (1130657017).
11113131201023 is an equidigital number, since it uses as much as digits as its factorization.
11113131201023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1130657016.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11113131201023 its reverse (32010213131111), we get a palindrome (43123344332134).
The spelling of 11113131201023 in words is "eleven trillion, one hundred thirteen billion, one hundred thirty-one million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •