Base | Representation |
---|---|
bin | 111100110101000… |
… | …1100011101010011 |
3 | 12021020200211121021 |
4 | 1321222030131103 |
5 | 13140010313321 |
6 | 534311540311 |
7 | 101403046066 |
oct | 17152143523 |
9 | 5236624537 |
10 | 2041104211 |
11 | 958171893 |
12 | 48b68a697 |
13 | 266b39693 |
14 | 1551188dd |
15 | be2d1941 |
hex | 79a8c753 |
2041104211 has 8 divisors (see below), whose sum is σ = 2066529024. Its totient is φ = 2015699400.
The previous prime is 2041104179. The next prime is 2041104229. The reversal of 2041104211 is 1124011402.
It is a happy number.
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 2041104211 - 25 = 2041104179 is a prime.
It is a super-2 number, since 2×20411042112 = 8332212800323865042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2041104011) 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, 408450 + ... + 413416.
It is an arithmetic number, because the mean of its divisors is an integer number (258316128).
Almost surely, 22041104211 is an apocalyptic number.
2041104211 is a deficient number, since it is larger than the sum of its proper divisors (25424813).
2041104211 is an equidigital number, since it uses as much as digits as its factorization.
2041104211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10001.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 2041104211 is about 45178.5813300949. The cubic root of 2041104211 is about 1268.4939286130.
Adding to 2041104211 its reverse (1124011402), we get a palindrome (3165115613).
The spelling of 2041104211 in words is "two billion, forty-one million, one hundred four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •