Base | Representation |
---|---|
bin | 100110001100011100… |
… | …101001000010000001 |
3 | 10220212010110212200212 |
4 | 212030130221002001 |
5 | 1132442310232001 |
6 | 30501252323505 |
7 | 2651201644433 |
oct | 461434510201 |
9 | 126763425625 |
10 | 41011024001 |
11 | 16435721372 |
12 | 7b46613595 |
13 | 3b3767c40c |
14 | 1db0988653 |
15 | 11006447bb |
hex | 98c729081 |
41011024001 has 4 divisors (see below), whose sum is σ = 41011830192. Its totient is φ = 41010217812.
The previous prime is 41011023997. The next prime is 41011024007. The reversal of 41011024001 is 10042011014.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 41011024001 - 22 = 41011023997 is a prime.
It is a super-2 number, since 2×410110240012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41011024007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 321251 + ... + 430376.
It is an arithmetic number, because the mean of its divisors is an integer number (10252957548).
Almost surely, 241011024001 is an apocalyptic number.
It is an amenable number.
41011024001 is a deficient number, since it is larger than the sum of its proper divisors (806191).
41011024001 is an equidigital number, since it uses as much as digits as its factorization.
41011024001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 806190.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 41011024001 its reverse (10042011014), we get a palindrome (51053035015).
The spelling of 41011024001 in words is "forty-one billion, eleven million, twenty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •