Base | Representation |
---|---|
bin | 10010110101110010000000… |
… | …10110010100110000001011 |
3 | 12102200200221012221100000111 |
4 | 21122321000112110300023 |
5 | 20412243311014144321 |
6 | 224040455512415151 |
7 | 11504146205415064 |
oct | 1132710026246013 |
9 | 172620835840014 |
10 | 41430334131211 |
11 | 12223562592093 |
12 | 47915870a74b7 |
13 | 1a16b2c8549ac |
14 | a3334b66956b |
15 | 4bca70ea75e1 |
hex | 25ae40594c0b |
41430334131211 has 8 divisors (see below), whose sum is σ = 42553963066160. Its totient is φ = 40306909942368.
The previous prime is 41430334131167. The next prime is 41430334131257. The reversal of 41430334131211 is 11213143303414.
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 41430334131211 - 237 = 41292895177739 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41430334111211) 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, 50776296 + ... + 51585781.
It is an arithmetic number, because the mean of its divisors is an integer number (5319245383270).
Almost surely, 241430334131211 is an apocalyptic number.
41430334131211 is a deficient number, since it is larger than the sum of its proper divisors (1123628934949).
41430334131211 is a wasteful number, since it uses less digits than its factorization.
41430334131211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102373053.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 41430334131211 its reverse (11213143303414), we get a palindrome (52643477434625).
The spelling of 41430334131211 in words is "forty-one trillion, four hundred thirty billion, three hundred thirty-four million, one hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •