Base | Representation |
---|---|
bin | 11101010001000110000… |
… | …111101010110011111101 |
3 | 21010021022110100022010020 |
4 | 131101012013222303331 |
5 | 230422440101010023 |
6 | 4135535304202353 |
7 | 265206635236353 |
oct | 35210607526375 |
9 | 7107273308106 |
10 | 2011221110013 |
11 | 705a5497a925 |
12 | 285955a693b9 |
13 | 11787122773b |
14 | 6d4b4c797d3 |
15 | 374b3195de3 |
hex | 1d4461eacfd |
2011221110013 has 8 divisors (see below), whose sum is σ = 2768132280576. Its totient is φ = 1297562006400.
The previous prime is 2011221109999. The next prime is 2011221110021. The reversal of 2011221110013 is 3100111221102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2011221110013 - 212 = 2011221105917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2011221109974 and 2011221110001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011221110513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10813016628 + ... + 10813016813.
It is an arithmetic number, because the mean of its divisors is an integer number (346016535072).
Almost surely, 22011221110013 is an apocalyptic number.
It is an amenable number.
2011221110013 is a deficient number, since it is larger than the sum of its proper divisors (756911170563).
2011221110013 is a wasteful number, since it uses less digits than its factorization.
2011221110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21626033475.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 2011221110013 its reverse (3100111221102), we get a palindrome (5111332331115).
The spelling of 2011221110013 in words is "two trillion, eleven billion, two hundred twenty-one million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •