Base | Representation |
---|---|
bin | 10010101010010000001110… |
… | …10111001001100110000111 |
3 | 12101021211112210221021001212 |
4 | 21111020013113021212013 |
5 | 20334301111202230421 |
6 | 223134511535242035 |
7 | 11433424514003543 |
oct | 1125100727114607 |
9 | 171254483837055 |
10 | 41034241055111 |
11 | 12090584351517 |
12 | 472886437931b |
13 | 19b8687779c55 |
14 | a1c0d430ca23 |
15 | 4b25dc59ae5b |
hex | 2552075c9987 |
41034241055111 has 4 divisors (see below), whose sum is σ = 41038457055912. Its totient is φ = 41030025054312.
The previous prime is 41034241055069. The next prime is 41034241055113. The reversal of 41034241055111 is 11155014243014.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41034241055111 is a prime.
It is a super-2 number, since 2×410342410551112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41034241055113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2107985801 + ... + 2108005266.
It is an arithmetic number, because the mean of its divisors is an integer number (10259614263978).
Almost surely, 241034241055111 is an apocalyptic number.
41034241055111 is a deficient number, since it is larger than the sum of its proper divisors (4216000801).
41034241055111 is an equidigital number, since it uses as much as digits as its factorization.
41034241055111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4216000800.
The product of its (nonzero) digits is 9600, while the sum is 32.
Adding to 41034241055111 its reverse (11155014243014), we get a palindrome (52189255298125).
The spelling of 41034241055111 in words is "forty-one trillion, thirty-four billion, two hundred forty-one million, fifty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •