Base | Representation |
---|---|
bin | 100110011111100010… |
… | …011100110111000001 |
3 | 10221200110011022010121 |
4 | 212133202130313001 |
5 | 1134121304022423 |
6 | 30553133300241 |
7 | 2662141242025 |
oct | 463742346701 |
9 | 127613138117 |
10 | 41331314113 |
11 | 1658a4a4041 |
12 | 8015934681 |
13 | 3b88b326ab |
14 | 2001320385 |
15 | 111d81045d |
hex | 99f89cdc1 |
41331314113 has 4 divisors (see below), whose sum is σ = 41453959300. Its totient is φ = 41208668928.
The previous prime is 41331314047. The next prime is 41331314117. The reversal of 41331314113 is 31141313314.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19806903169 + 21524410944 = 140737^2 + 146712^2 .
It is a cyclic number.
It is not a de Polignac number, because 41331314113 - 217 = 41331183041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41331314117) 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 3 ways as a sum of consecutive naturals, for example, 61322088 + ... + 61322761.
It is an arithmetic number, because the mean of its divisors is an integer number (10363489825).
Almost surely, 241331314113 is an apocalyptic number.
It is an amenable number.
41331314113 is a deficient number, since it is larger than the sum of its proper divisors (122645187).
41331314113 is a wasteful number, since it uses less digits than its factorization.
41331314113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122645186.
The product of its digits is 1296, while the sum is 25.
Adding to 41331314113 its reverse (31141313314), we get a palindrome (72472627427).
The spelling of 41331314113 in words is "forty-one billion, three hundred thirty-one million, three hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •