Base | Representation |
---|---|
bin | 10010110010000101001110… |
… | …10110111111011000110011 |
3 | 12102020112210221202001122001 |
4 | 21121002213112333120303 |
5 | 20403202440103341321 |
6 | 223502233444554431 |
7 | 11462026062466054 |
oct | 1131024726773063 |
9 | 172215727661561 |
10 | 41303213340211 |
11 | 1218465a181329 |
12 | 4770a0a6b2a17 |
13 | 1a07b51321734 |
14 | a2b12c72272b |
15 | 4b95d0cc7c91 |
hex | 2590a75bf633 |
41303213340211 has 8 divisors (see below), whose sum is σ = 43119998457120. Its totient is φ = 39488177659392.
The previous prime is 41303213340173. The next prime is 41303213340253. The reversal of 41303213340211 is 11204331230314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41303213340211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41303213340211.
It is not an unprimeable number, because it can be changed into a prime (41303213340811) 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, 437310766 + ... + 437405203.
It is an arithmetic number, because the mean of its divisors is an integer number (5389999807140).
Almost surely, 241303213340211 is an apocalyptic number.
41303213340211 is a deficient number, since it is larger than the sum of its proper divisors (1816785116909).
41303213340211 is a wasteful number, since it uses less digits than its factorization.
41303213340211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874718045.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 41303213340211 its reverse (11204331230314), we get a palindrome (52507544570525).
The spelling of 41303213340211 in words is "forty-one trillion, three hundred three billion, two hundred thirteen million, three hundred forty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •