Base | Representation |
---|---|
bin | 1010000001100000111010… |
… | …0110011010101011101001 |
3 | 1110000121110120102101121011 |
4 | 2200120032212122223221 |
5 | 2421032234021031241 |
6 | 35235012050543521 |
7 | 2215151621044423 |
oct | 240301646325351 |
9 | 43017416371534 |
10 | 11021131033321 |
11 | 356a04316a012 |
12 | 129bb76597ba1 |
13 | 61c399226a76 |
14 | 2a15d5b57813 |
15 | 141a4188b281 |
hex | a060e99aae9 |
11021131033321 has 8 divisors (see below), whose sum is σ = 11401693606080. Its totient is φ = 10640603365392.
The previous prime is 11021131033301. The next prime is 11021131033327. The reversal of 11021131033321 is 12333013112011.
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 11021131033321 - 225 = 11021097478889 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11021131033292 and 11021131033301.
It is not an unprimeable number, because it can be changed into a prime (11021131033327) 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, 8083005 + ... + 9347578.
It is an arithmetic number, because the mean of its divisors is an integer number (1425211700760).
Almost surely, 211021131033321 is an apocalyptic number.
It is an amenable number.
11021131033321 is a deficient number, since it is larger than the sum of its proper divisors (380562572759).
11021131033321 is a wasteful number, since it uses less digits than its factorization.
11021131033321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17452415.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11021131033321 its reverse (12333013112011), we get a palindrome (23354144145332).
The spelling of 11021131033321 in words is "eleven trillion, twenty-one billion, one hundred thirty-one million, thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •