Base | Representation |
---|---|
bin | 100110001110110001… |
… | …101111110000011001 |
3 | 10220221212000200222112 |
4 | 212032301233300121 |
5 | 1133032312023001 |
6 | 30505210202105 |
7 | 2652155120624 |
oct | 461661576031 |
9 | 126855020875 |
10 | 41050111001 |
11 | 16455798a79 |
12 | 7b57723335 |
13 | 3b427b6513 |
14 | 1db5c40dbb |
15 | 1103cb5cbb |
hex | 98ec6fc19 |
41050111001 has 8 divisors (see below), whose sum is σ = 42877922880. Its totient is φ = 39249785232.
The previous prime is 41050110989. The next prime is 41050111019. The reversal of 41050111001 is 10011105014.
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 41050111001 - 210 = 41050109977 is a prime.
It is a super-3 number, since 3×410501110013 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41050111031) 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, 6868475 + ... + 6874448.
It is an arithmetic number, because the mean of its divisors is an integer number (5359740360).
Almost surely, 241050111001 is an apocalyptic number.
It is an amenable number.
41050111001 is a deficient number, since it is larger than the sum of its proper divisors (1827811879).
41050111001 is a wasteful number, since it uses less digits than its factorization.
41050111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13743055.
The product of its (nonzero) digits is 20, while the sum is 14.
Adding to 41050111001 its reverse (10011105014), we get a palindrome (51061216015).
The spelling of 41050111001 in words is "forty-one billion, fifty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •