Base | Representation |
---|---|
bin | 10010110010000110111001… |
… | …11000110111110000111101 |
3 | 12102020122010112121221201120 |
4 | 21121003130320313300331 |
5 | 20403211310010224313 |
6 | 223502502525501153 |
7 | 11462060246134005 |
oct | 1131033470676075 |
9 | 172218115557646 |
10 | 41304111414333 |
11 | 12184a80108749 |
12 | 477101b4117b9 |
13 | 1a07c653c2641 |
14 | a2b1b5adb005 |
15 | 4b9634a73d23 |
hex | 2590dce37c3d |
41304111414333 has 8 divisors (see below), whose sum is σ = 55072368587808. Its totient is φ = 27535964258544.
The previous prime is 41304111414331. The next prime is 41304111414361. The reversal of 41304111414333 is 33341411140314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41304111414333 - 21 = 41304111414331 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41304111414294 and 41304111414303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41304111414331) 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, 26624391 + ... + 28133012.
It is an arithmetic number, because the mean of its divisors is an integer number (6884046073476).
Almost surely, 241304111414333 is an apocalyptic number.
It is an amenable number.
41304111414333 is a deficient number, since it is larger than the sum of its proper divisors (13768257173475).
41304111414333 is a wasteful number, since it uses less digits than its factorization.
41304111414333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55008843.
The product of its (nonzero) digits is 20736, while the sum is 33.
Adding to 41304111414333 its reverse (33341411140314), we get a palindrome (74645522554647).
The spelling of 41304111414333 in words is "forty-one trillion, three hundred four billion, one hundred eleven million, four hundred fourteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •