Base | Representation |
---|---|
bin | 1010000001010010011010… |
… | …1111010100000011000101 |
3 | 1110000020102110201211111012 |
4 | 2200110212233110003011 |
5 | 2421001302202120313 |
6 | 35233130051052005 |
7 | 2214653334536156 |
oct | 240244657240305 |
9 | 43006373654435 |
10 | 11017241051333 |
11 | 3568427399a70 |
12 | 129b26b8a1005 |
13 | 61bbc934598a |
14 | 2a134728192d |
15 | 1418b50e8da8 |
hex | a0526bd40c5 |
11017241051333 has 4 divisors (see below), whose sum is σ = 12018808419648. Its totient is φ = 10015673683020.
The previous prime is 11017241051303. The next prime is 11017241051423. The reversal of 11017241051333 is 33315014271011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11017241051333 - 26 = 11017241051269 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11017241051333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11017241051303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500783684141 + ... + 500783684162.
It is an arithmetic number, because the mean of its divisors is an integer number (3004702104912).
Almost surely, 211017241051333 is an apocalyptic number.
It is an amenable number.
11017241051333 is a deficient number, since it is larger than the sum of its proper divisors (1001567368315).
11017241051333 is a wasteful number, since it uses less digits than its factorization.
11017241051333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1001567368314.
The product of its (nonzero) digits is 7560, while the sum is 32.
The spelling of 11017241051333 in words is "eleven trillion, seventeen billion, two hundred forty-one million, fifty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •