Base | Representation |
---|---|
bin | 111100110101000… |
… | …1110010111100001 |
3 | 12021020201020022222 |
4 | 1321222032113201 |
5 | 13140011041113 |
6 | 534312040425 |
7 | 101403110642 |
oct | 17152162741 |
9 | 5236636288 |
10 | 2041112033 |
11 | 958177754 |
12 | 48b693115 |
13 | 266b400cc |
14 | 15511b6c9 |
15 | be2d3e08 |
hex | 79a8e5e1 |
2041112033 has 8 divisors (see below), whose sum is σ = 2077652736. Its totient is φ = 2004670800.
The previous prime is 2041111999. The next prime is 2041112057. The reversal of 2041112033 is 3302111402.
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 2041112033 - 220 = 2040063457 is a prime.
It is a super-2 number, since 2×20411120332 = 8332276662514786178, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2041112233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17168 + ... + 66158.
It is an arithmetic number, because the mean of its divisors is an integer number (259706592).
Almost surely, 22041112033 is an apocalyptic number.
It is an amenable number.
2041112033 is a deficient number, since it is larger than the sum of its proper divisors (36540703).
2041112033 is an equidigital number, since it uses as much as digits as its factorization.
2041112033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49735.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2041112033 is about 45178.6678975819. The cubic root of 2041112033 is about 1268.4955490017.
Adding to 2041112033 its reverse (3302111402), we get a palindrome (5343223435).
The spelling of 2041112033 in words is "two billion, forty-one million, one hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •