Base | Representation |
---|---|
bin | 100110010010011010… |
… | …001001000111111001 |
3 | 10221010002122211022102 |
4 | 212102122021013321 |
5 | 1133143411013223 |
6 | 30515224033145 |
7 | 2653525003031 |
oct | 462232110771 |
9 | 127102584272 |
10 | 41111032313 |
11 | 1648711906a |
12 | 7b740027b5 |
13 | 3b522c6930 |
14 | 1dbdd7c8c1 |
15 | 11092eb928 |
hex | 9926891f9 |
41111032313 has 8 divisors (see below), whose sum is σ = 44555417928. Its totient is φ = 37706932224.
The previous prime is 41111032309. The next prime is 41111032373. The reversal of 41111032313 is 31323011114.
It can be written as a sum of positive squares in 4 ways, for example, as 279959824 + 40831072489 = 16732^2 + 202067^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41111032313 - 22 = 41111032309 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (41111032373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10069256 + ... + 10073337.
It is an arithmetic number, because the mean of its divisors is an integer number (5569427241).
Almost surely, 241111032313 is an apocalyptic number.
It is an amenable number.
41111032313 is a deficient number, since it is larger than the sum of its proper divisors (3444385615).
41111032313 is a wasteful number, since it uses less digits than its factorization.
41111032313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20142763.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 41111032313 its reverse (31323011114), we get a palindrome (72434043427).
The spelling of 41111032313 in words is "forty-one billion, one hundred eleven million, thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •