Base | Representation |
---|---|
bin | 10010110010010110000001… |
… | …10100100000000011111011 |
3 | 12102021102002101000020210202 |
4 | 21121023000310200003323 |
5 | 20403324421443104321 |
6 | 223510324320432415 |
7 | 11462465403543212 |
oct | 1131130064400373 |
9 | 172242071006722 |
10 | 41312230441211 |
11 | 12188467092814 |
12 | 477270647870b |
13 | 1a0895a4ab762 |
14 | a2b74610a079 |
15 | 4b995c73170b |
hex | 2592c0d200fb |
41312230441211 has 8 divisors (see below), whose sum is σ = 41376865388544. Its totient is φ = 41247596693160.
The previous prime is 41312230441171. The next prime is 41312230441217. The reversal of 41312230441211 is 11214403221314.
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 41312230441211 - 26 = 41312230441147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41312230441217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89769266 + ... + 90228296.
It is an arithmetic number, because the mean of its divisors is an integer number (5172108173568).
Almost surely, 241312230441211 is an apocalyptic number.
41312230441211 is a deficient number, since it is larger than the sum of its proper divisors (64634947333).
41312230441211 is a wasteful number, since it uses less digits than its factorization.
41312230441211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 599641.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 41312230441211 its reverse (11214403221314), we get a palindrome (52526633662525).
The spelling of 41312230441211 in words is "forty-one trillion, three hundred twelve billion, two hundred thirty million, four hundred forty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •