Base | Representation |
---|---|
bin | 10010110111111011011110… |
… | …00100000111011000011001 |
3 | 12102221202102100021022112120 |
4 | 21123331233010013120121 |
5 | 20420000430334043113 |
6 | 224134422444131453 |
7 | 11512401042645441 |
oct | 1133755704073031 |
9 | 172852370238476 |
10 | 41504132331033 |
11 | 12251892765979 |
12 | 47a3941b36b89 |
13 | 1a20a90b56258 |
14 | a36b4c8a5121 |
15 | 4be93ec7aa23 |
hex | 25bf6f107619 |
41504132331033 has 8 divisors (see below), whose sum is σ = 56688570988896. Its totient is φ = 26994557613600.
The previous prime is 41504132330939. The next prime is 41504132331059. The reversal of 41504132331033 is 33013323140514.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41504132331033 - 214 = 41504132314649 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41504132330985 and 41504132331003.
It is not an unprimeable number, because it can be changed into a prime (41504132331083) 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, 168715984963 + ... + 168715985208.
It is an arithmetic number, because the mean of its divisors is an integer number (7086071373612).
Almost surely, 241504132331033 is an apocalyptic number.
It is an amenable number.
41504132331033 is a deficient number, since it is larger than the sum of its proper divisors (15184438657863).
41504132331033 is a wasteful number, since it uses less digits than its factorization.
41504132331033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337431970215.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 41504132331033 its reverse (33013323140514), we get a palindrome (74517455471547).
The spelling of 41504132331033 in words is "forty-one trillion, five hundred four billion, one hundred thirty-two million, three hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •