Base | Representation |
---|---|
bin | 10010101010011100111011… |
… | …11101010010110111000111 |
3 | 12101022111011012212212021021 |
4 | 21111032131331102313013 |
5 | 20334404044011313411 |
6 | 223142000500532011 |
7 | 11434055535136054 |
oct | 1125163575226707 |
9 | 171274135785237 |
10 | 41041062604231 |
11 | 120934649a1318 |
12 | 472a0489b1007 |
13 | 19b9203b02151 |
14 | a1c58029602b |
15 | 4b288b3b5a71 |
hex | 25539df52dc7 |
41041062604231 has 8 divisors (see below), whose sum is σ = 41742095253840. Its totient is φ = 40345361001792.
The previous prime is 41041062604219. The next prime is 41041062604249. The reversal of 41041062604231 is 13240626014014.
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 41041062604231 - 219 = 41041062079943 is a prime.
It is a super-2 number, since 2×410410626042312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41041062604631) 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, 1332746265 + ... + 1332777058.
It is an arithmetic number, because the mean of its divisors is an integer number (5217761906730).
Almost surely, 241041062604231 is an apocalyptic number.
41041062604231 is a deficient number, since it is larger than the sum of its proper divisors (701032649609).
41041062604231 is a wasteful number, since it uses less digits than its factorization.
41041062604231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2665523585.
The product of its (nonzero) digits is 27648, while the sum is 34.
Adding to 41041062604231 its reverse (13240626014014), we get a palindrome (54281688618245).
The spelling of 41041062604231 in words is "forty-one trillion, forty-one billion, sixty-two million, six hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •