Base | Representation |
---|---|
bin | 10010110011001101011110… |
… | …10110111001111010110001 |
3 | 12102101020221012220101121122 |
4 | 21121212233112321322301 |
5 | 20404321410033204301 |
6 | 223532130441432025 |
7 | 11464601232634004 |
oct | 1131465726717261 |
9 | 172336835811548 |
10 | 41342002241201 |
11 | 1219a0545327a2 |
12 | 4778434a9b615 |
13 | 1a0b6c34c495c |
14 | a2cd6c11153b |
15 | 4ba6012d081b |
hex | 2599af5b9eb1 |
41342002241201 has 8 divisors (see below), whose sum is σ = 41355027308160. Its totient is φ = 41328977940208.
The previous prime is 41342002241129. The next prime is 41342002241203. The reversal of 41342002241201 is 10214220024314.
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 41342002241201 - 222 = 41341998046897 is a prime.
It is a super-2 number, since 2×413420022412012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41342002241203) 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, 119434760 + ... + 119780406.
It is an arithmetic number, because the mean of its divisors is an integer number (5169378413520).
Almost surely, 241342002241201 is an apocalyptic number.
It is an amenable number.
41342002241201 is a deficient number, since it is larger than the sum of its proper divisors (13025066959).
41342002241201 is a wasteful number, since it uses less digits than its factorization.
41342002241201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382983.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 41342002241201 its reverse (10214220024314), we get a palindrome (51556222265515).
The spelling of 41342002241201 in words is "forty-one trillion, three hundred forty-two billion, two million, two hundred forty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •