Base | Representation |
---|---|
bin | 10010110010111111001101… |
… | …10001011100100010000011 |
3 | 12102100112011100211101021101 |
4 | 21121133212301130202003 |
5 | 20404210213023323021 |
6 | 223524422400235231 |
7 | 11464210346022250 |
oct | 1131374661344203 |
9 | 172315140741241 |
10 | 41334342011011 |
11 | 12196883532445 |
12 | 4776a5760bb17 |
13 | 1a0aa7249547a |
14 | a2c842a10427 |
15 | 4ba303a4ca91 |
hex | 2597e6c5c883 |
41334342011011 has 16 divisors (see below), whose sum is σ = 47972156359680. Its totient is φ = 34881162392160.
The previous prime is 41334342011009. The next prime is 41334342011041. The reversal of 41334342011011 is 11011024343314.
41334342011011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 41334342011011 - 21 = 41334342011009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (41334342011041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58299031 + ... + 59003776.
It is an arithmetic number, because the mean of its divisors is an integer number (2998259772480).
Almost surely, 241334342011011 is an apocalyptic number.
41334342011011 is a deficient number, since it is larger than the sum of its proper divisors (6637814348669).
41334342011011 is a wasteful number, since it uses less digits than its factorization.
41334342011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117303594.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 41334342011011 its reverse (11011024343314), we get a palindrome (52345366354325).
The spelling of 41334342011011 in words is "forty-one trillion, three hundred thirty-four billion, three hundred forty-two million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •