Base | Representation |
---|---|
bin | 11101010000111001001… |
… | …101000111001010010010 |
3 | 21010020202100121222012020 |
4 | 131100321031013022102 |
5 | 230422014113324132 |
6 | 4135502004112310 |
7 | 265201364433153 |
oct | 35207115071222 |
9 | 7106670558166 |
10 | 2011004433042 |
11 | 705953637250 |
12 | 2858b5395696 |
13 | 117838381707 |
14 | 6d49419592a |
15 | 3749e14552c |
hex | 1d439347292 |
2011004433042 has 16 divisors (see below), whose sum is σ = 4387646035872. Its totient is φ = 609395282720.
The previous prime is 2011004432999. The next prime is 2011004433047. The reversal of 2011004433042 is 2403344001102.
It is a super-2 number, since 2×20110044330422 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2011004433047) 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 7 ways as a sum of consecutive naturals, for example, 15234882003 + ... + 15234882134.
It is an arithmetic number, because the mean of its divisors is an integer number (274227877242).
Almost surely, 22011004433042 is an apocalyptic number.
2011004433042 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2011004433042 is an abundant number, since it is smaller than the sum of its proper divisors (2376641602830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011004433042 is a wasteful number, since it uses less digits than its factorization.
2011004433042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30469764153.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 2011004433042 its reverse (2403344001102), we get a palindrome (4414348434144).
The spelling of 2011004433042 in words is "two trillion, eleven billion, four million, four hundred thirty-three thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •