Base | Representation |
---|---|
bin | 11101010000111001100… |
… | …110111101101100111001 |
3 | 21010020202211101021111012 |
4 | 131100321212331230321 |
5 | 230422022332210131 |
6 | 4135502405243305 |
7 | 265201506150161 |
oct | 35207146755471 |
9 | 7106684337435 |
10 | 2011011210041 |
11 | 705957445979 |
12 | 2858b7703535 |
13 | 1178398b5282 |
14 | 6d49503b5a1 |
15 | 3749ea3352b |
hex | 1d4399bdb39 |
2011011210041 has 4 divisors (see below), whose sum is σ = 2026362440784. Its totient is φ = 1995659979300.
The previous prime is 2011011209971. The next prime is 2011011210049. The reversal of 2011011210041 is 1400121101102.
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 a de Polignac number, because none of the positive numbers 2k-2011011210041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011011209998 and 2011011210025.
It is not an unprimeable number, because it can be changed into a prime (2011011210049) 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, 7675615175 + ... + 7675615436.
It is an arithmetic number, because the mean of its divisors is an integer number (506590610196).
Almost surely, 22011011210041 is an apocalyptic number.
It is an amenable number.
2011011210041 is a deficient number, since it is larger than the sum of its proper divisors (15351230743).
2011011210041 is a wasteful number, since it uses less digits than its factorization.
2011011210041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15351230742.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2011011210041 its reverse (1400121101102), we get a palindrome (3411132311143).
The spelling of 2011011210041 in words is "two trillion, eleven billion, eleven million, two hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •