Base | Representation |
---|---|
bin | 1010000000011010110011… |
… | …1001111000110111001001 |
3 | 1102221210220001021121001200 |
4 | 2200012230321320313021 |
5 | 2420230213344220241 |
6 | 35222220431534413 |
7 | 2213614356545442 |
oct | 240065471706711 |
9 | 42853801247050 |
10 | 11002312101321 |
11 | 3562066395952 |
12 | 12983a408a409 |
13 | 61a68a445348 |
14 | 2a072c6742c9 |
15 | 1412de66b4b6 |
hex | a01ace78dc9 |
11002312101321 has 48 divisors (see below), whose sum is σ = 16552996641792. Its totient is φ = 7034199782400.
The previous prime is 11002312101229. The next prime is 11002312101331. The reversal of 11002312101321 is 12310121320011.
11002312101321 is a `hidden beast` number, since 1 + 10 + 0 + 231 + 2 + 101 + 321 = 666.
It is not a de Polignac number, because 11002312101321 - 217 = 11002311970249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11002312101294 and 11002312101303.
It is not an unprimeable number, because it can be changed into a prime (11002312101331) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 197425741 + ... + 197481461.
It is an arithmetic number, because the mean of its divisors is an integer number (344854096704).
Almost surely, 211002312101321 is an apocalyptic number.
It is an amenable number.
11002312101321 is a deficient number, since it is larger than the sum of its proper divisors (5550684540471).
11002312101321 is a wasteful number, since it uses less digits than its factorization.
11002312101321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62134 (or 62131 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11002312101321 its reverse (12310121320011), we get a palindrome (23312433421332).
The spelling of 11002312101321 in words is "eleven trillion, two billion, three hundred twelve million, one hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •