Base | Representation |
---|---|
bin | 1010000000110111011111… |
… | …0010110110110110011101 |
3 | 1102222112202121010011220101 |
4 | 2200031313302312312131 |
5 | 2420342000304001341 |
6 | 35225532414021101 |
7 | 2214306223242022 |
oct | 240156762666635 |
9 | 42875677104811 |
10 | 11010011000221 |
11 | 35653571a7612 |
12 | 12999924a7791 |
13 | 61b31649341c |
14 | 2a0c5cd5d549 |
15 | 1415e04db831 |
hex | a0377cb6d9d |
11010011000221 has 8 divisors (see below), whose sum is σ = 11272816124064. Its totient is φ = 10747513074480.
The previous prime is 11010011000207. The next prime is 11010011000231. The reversal of 11010011000221 is 12200011001011.
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 11010011000221 - 223 = 11010002611613 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010011000198 and 11010011000207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010011000231) 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, 76726990 + ... + 76870351.
It is an arithmetic number, because the mean of its divisors is an integer number (1409102015508).
Almost surely, 211010011000221 is an apocalyptic number.
It is an amenable number.
11010011000221 is a deficient number, since it is larger than the sum of its proper divisors (262805123843).
11010011000221 is a wasteful number, since it uses less digits than its factorization.
11010011000221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153599051.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11010011000221 its reverse (12200011001011), we get a palindrome (23210022001232).
The spelling of 11010011000221 in words is "eleven trillion, ten billion, eleven million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •