Base | Representation |
---|---|
bin | 1010010010010101110010… |
… | …0100101100010110111001 |
3 | 1111001020121102110200002001 |
4 | 2210211130210230112321 |
5 | 2440301243203404423 |
6 | 40015500213141001 |
7 | 2245064230611313 |
oct | 244453444542671 |
9 | 44036542420061 |
10 | 11310202013113 |
11 | 36706a21a8703 |
12 | 1327bab92a761 |
13 | 640716a507c3 |
14 | 2b15b95c47b3 |
15 | 14930e82bcad |
hex | a495c92c5b9 |
11310202013113 has 8 divisors (see below), whose sum is σ = 11496874173120. Its totient is φ = 11124290229360.
The previous prime is 11310202013111. The next prime is 11310202013129. The reversal of 11310202013113 is 31131020201311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11310202013113 - 21 = 11310202013111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11310202013111) 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, 190064070 + ... + 190123567.
It is an arithmetic number, because the mean of its divisors is an integer number (1437109271640).
Almost surely, 211310202013113 is an apocalyptic number.
It is an amenable number.
11310202013113 is a deficient number, since it is larger than the sum of its proper divisors (186672160007).
11310202013113 is an equidigital number, since it uses as much as digits as its factorization.
11310202013113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380188127.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11310202013113 its reverse (31131020201311), we get a palindrome (42441222214424).
It can be divided in two parts, 1131020201311 and 3, that multiplied together give a palindrome (3393060603933).
The spelling of 11310202013113 in words is "eleven trillion, three hundred ten billion, two hundred two million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •