Base | Representation |
---|---|
bin | 10010110101001110000000… |
… | …01000011010010101001011 |
3 | 12102121212001000020210020112 |
4 | 21122213000020122111023 |
5 | 20411434213300144321 |
6 | 224023541402144535 |
7 | 11502563155550360 |
oct | 1132470010322513 |
9 | 172555030223215 |
10 | 41411003131211 |
11 | 1221634275972a |
12 | 47898911b214b |
13 | 1a1506b95425c |
14 | a3243616c467 |
15 | 4bc2ddd38a5b |
hex | 25a9c021a54b |
41411003131211 has 8 divisors (see below), whose sum is σ = 47328433753344. Its totient is φ = 35493965767080.
The previous prime is 41411003131097. The next prime is 41411003131249. The reversal of 41411003131211 is 11213130011414.
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 41411003131211 - 226 = 41410936022347 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41411003131811) 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, 98088815 + ... + 98510088.
It is an arithmetic number, because the mean of its divisors is an integer number (5916054219168).
Almost surely, 241411003131211 is an apocalyptic number.
41411003131211 is a deficient number, since it is larger than the sum of its proper divisors (5917430622133).
41411003131211 is a wasteful number, since it uses less digits than its factorization.
41411003131211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196629001.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 41411003131211 its reverse (11213130011414), we get a palindrome (52624133142625).
The spelling of 41411003131211 in words is "forty-one trillion, four hundred eleven billion, three million, one hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •