Base | Representation |
---|---|
bin | 1010000000011010110011… |
… | …1101110001110101101011 |
3 | 1102221210220010012101222102 |
4 | 2200012230331301311223 |
5 | 2420230214124334011 |
6 | 35222220505444015 |
7 | 2213614401323603 |
oct | 240065475616553 |
9 | 42853803171872 |
10 | 11002313121131 |
11 | 3562066a22072 |
12 | 12983a44a060b |
13 | 61a68a711597 |
14 | 2a072c85bc03 |
15 | 1412de7bd73b |
hex | a01acf71d6b |
11002313121131 has 12 divisors (see below), whose sum is σ = 11375222999400. Its totient is φ = 10638524283840.
The previous prime is 11002313121119. The next prime is 11002313121133. The reversal of 11002313121131 is 13112131320011.
It is not a de Polignac number, because 11002313121131 - 210 = 11002313120107 is a prime.
It is a super-2 number, since 2×110023131211312 (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 (11002313121133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24838226 + ... + 25277303.
It is an arithmetic number, because the mean of its divisors is an integer number (947935249950).
Almost surely, 211002313121131 is an apocalyptic number.
11002313121131 is a deficient number, since it is larger than the sum of its proper divisors (372909878269).
11002313121131 is an frugal number, since it uses more digits than its factorization.
11002313121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50115710 (or 50115649 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11002313121131 its reverse (13112131320011), we get a palindrome (24114444441142).
The spelling of 11002313121131 in words is "eleven trillion, two billion, three hundred thirteen million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •