Base | Representation |
---|---|
bin | 1010000111111011010111… |
… | …1010001110010111001101 |
3 | 1110102010212021201202100020 |
4 | 2201332311322032113031 |
5 | 2424333411411000323 |
6 | 35401353151452353 |
7 | 2226132202405116 |
oct | 241766572162715 |
9 | 43363767652306 |
10 | 11131312203213 |
11 | 3601843600804 |
12 | 12b93a5b270b9 |
13 | 6298a8117197 |
14 | 2a6a8901b20d |
15 | 14483e81dae3 |
hex | a1fb5e8e5cd |
11131312203213 has 8 divisors (see below), whose sum is σ = 14988697620576. Its totient is φ = 7347400794000.
The previous prime is 11131312203199. The next prime is 11131312203217. The reversal of 11131312203213 is 31230221313111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11131312203213 - 29 = 11131312202701 is a prime.
It is a super-2 number, since 2×111313122032132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131312203217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18368501683 + ... + 18368502288.
It is an arithmetic number, because the mean of its divisors is an integer number (1873587202572).
Almost surely, 211131312203213 is an apocalyptic number.
It is an amenable number.
11131312203213 is a deficient number, since it is larger than the sum of its proper divisors (3857385417363).
11131312203213 is a wasteful number, since it uses less digits than its factorization.
11131312203213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36737004075.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 11131312203213 its reverse (31230221313111), we get a palindrome (42361533516324).
The spelling of 11131312203213 in words is "eleven trillion, one hundred thirty-one billion, three hundred twelve million, two hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •