Base | Representation |
---|---|
bin | 10010101010011110111000… |
… | …11001111100101101111101 |
3 | 12101022120212020022110221010 |
4 | 21111033130121330231331 |
5 | 20334413220214144401 |
6 | 223142252444425433 |
7 | 11434123516341525 |
oct | 1125173431745575 |
9 | 171276766273833 |
10 | 41042110303101 |
11 | 12093952333a56 |
12 | 472a29b848279 |
13 | 19b933cba01cb |
14 | a1c63d49c685 |
15 | 4b28ed369ed6 |
hex | 2553dc67cb7d |
41042110303101 has 8 divisors (see below), whose sum is σ = 54767558479680. Its totient is φ = 27339034497632.
The previous prime is 41042110303097. The next prime is 41042110303111. The reversal of 41042110303101 is 10130301124014.
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 41042110303101 - 22 = 41042110303097 is a prime.
It is a super-3 number, since 3×410421103031013 (a number of 42 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41042110303111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5593088496 + ... + 5593095833.
It is an arithmetic number, because the mean of its divisors is an integer number (6845944809960).
Almost surely, 241042110303101 is an apocalyptic number.
It is an amenable number.
41042110303101 is a deficient number, since it is larger than the sum of its proper divisors (13725448176579).
41042110303101 is a wasteful number, since it uses less digits than its factorization.
41042110303101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11186185555.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 41042110303101 its reverse (10130301124014), we get a palindrome (51172411427115).
The spelling of 41042110303101 in words is "forty-one trillion, forty-two billion, one hundred ten million, three hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •