Base | Representation |
---|---|
bin | 10010110010111001011001… |
… | …10111011111000011101001 |
3 | 12102100020002222220211110202 |
4 | 21121130230313133003221 |
5 | 20404132321044011131 |
6 | 223523145101521545 |
7 | 11464040144110145 |
oct | 1131345467370351 |
9 | 172306088824422 |
10 | 41331223032041 |
11 | 12195522998378 |
12 | 4776326b732b5 |
13 | 1a0a696253997 |
14 | a2c6286b6225 |
15 | 4ba1bed05bcb |
hex | 25972cddf0e9 |
41331223032041 has 8 divisors (see below), whose sum is σ = 41480889588864. Its totient is φ = 41181574776160.
The previous prime is 41331223032031. The next prime is 41331223032091. The reversal of 41331223032041 is 14023032213314.
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 41331223032041 - 230 = 41330149290217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41331223031995 and 41331223032013.
It is not an unprimeable number, because it can be changed into a prime (41331223032031) 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, 42101 + ... + 9091986.
It is an arithmetic number, because the mean of its divisors is an integer number (5185111198608).
Almost surely, 241331223032041 is an apocalyptic number.
It is an amenable number.
41331223032041 is a deficient number, since it is larger than the sum of its proper divisors (149666556823).
41331223032041 is a wasteful number, since it uses less digits than its factorization.
41331223032041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9150471.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 41331223032041 its reverse (14023032213314), we get a palindrome (55354255245355).
The spelling of 41331223032041 in words is "forty-one trillion, three hundred thirty-one billion, two hundred twenty-three million, thirty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •