Base | Representation |
---|---|
bin | 1010000010101011101011… |
… | …1000001100000011010001 |
3 | 1110002112021022001122111020 |
4 | 2200222322320030003101 |
5 | 2421344340004223241 |
6 | 35252131405110053 |
7 | 2216462155025325 |
oct | 240527270140321 |
9 | 43075238048436 |
10 | 11041201242321 |
11 | 35776022920a8 |
12 | 12a3a37b58329 |
13 | 621247314393 |
14 | 2a257b4b7985 |
15 | 142318874b66 |
hex | a0abae0c0d1 |
11041201242321 has 32 divisors (see below), whose sum is σ = 16234603822080. Its totient is φ = 6643624680000.
The previous prime is 11041201242317. The next prime is 11041201242347. The reversal of 11041201242321 is 12324210214011.
It is not a de Polignac number, because 11041201242321 - 22 = 11041201242317 is a prime.
It is a super-2 number, since 2×110412012423212 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11041201242291 and 11041201242300.
It is not an unprimeable number, because it can be changed into a prime (11041201242361) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16447770 + ... + 17105891.
It is an arithmetic number, because the mean of its divisors is an integer number (507331369440).
Almost surely, 211041201242321 is an apocalyptic number.
It is an amenable number.
11041201242321 is a deficient number, since it is larger than the sum of its proper divisors (5193402579759).
11041201242321 is a wasteful number, since it uses less digits than its factorization.
11041201242321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33553957.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 11041201242321 its reverse (12324210214011), we get a palindrome (23365411456332).
The spelling of 11041201242321 in words is "eleven trillion, forty-one billion, two hundred one million, two hundred forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •