Base | Representation |
---|---|
bin | 11101010000111010001… |
… | …101000101101001001001 |
3 | 21010020210112012000200100 |
4 | 131100322031011221021 |
5 | 230422032412012131 |
6 | 4135503403400013 |
7 | 265201660123203 |
oct | 35207215055111 |
9 | 7106715160610 |
10 | 2011021204041 |
11 | 705962051583 |
12 | 2858bab23009 |
13 | 11783b9a4195 |
14 | 6d4964bd773 |
15 | 374a08597e6 |
hex | 1d43a345a49 |
2011021204041 has 12 divisors (see below), whose sum is σ = 2905006782132. Its totient is φ = 1340589244416.
The previous prime is 2011021204013. The next prime is 2011021204057. The reversal of 2011021204041 is 1404021201102.
It can be written as a sum of positive squares in 2 ways, for example, as 1818735446025 + 192285758016 = 1348605^2 + 438504^2 .
It is not a de Polignac number, because 2011021204041 - 27 = 2011021203913 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2011021202041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7490616 + ... + 7754441.
It is an arithmetic number, because the mean of its divisors is an integer number (242083898511).
Almost surely, 22011021204041 is an apocalyptic number.
It is an amenable number.
2011021204041 is a deficient number, since it is larger than the sum of its proper divisors (893985578091).
2011021204041 is a wasteful number, since it uses less digits than its factorization.
2011021204041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15259720 (or 15259717 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2011021204041 its reverse (1404021201102), we get a palindrome (3415042405143).
The spelling of 2011021204041 in words is "two trillion, eleven billion, twenty-one million, two hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •