Base | Representation |
---|---|
bin | 100110001100000110… |
… | …111011111000001111 |
3 | 10220211201202210112020 |
4 | 212030012323320033 |
5 | 1132434331142111 |
6 | 30500530341223 |
7 | 2651102405544 |
oct | 461406737017 |
9 | 126751683466 |
10 | 41005334031 |
11 | 16432495412 |
12 | 7b4472a813 |
13 | 3b3643957c |
14 | 1dadd06bcb |
15 | 10eedbd906 |
hex | 98c1bbe0f |
41005334031 has 8 divisors (see below), whose sum is σ = 54674997504. Its totient is φ = 27336279960.
The previous prime is 41005334003. The next prime is 41005334081. The reversal of 41005334031 is 13043350014.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41005334031 - 219 = 41004809743 is a prime.
It is a super-2 number, since 2×410053340312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41005333992 and 41005334010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41005334081) 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 7 ways as a sum of consecutive naturals, for example, 38986 + ... + 289016.
It is an arithmetic number, because the mean of its divisors is an integer number (6834374688).
Almost surely, 241005334031 is an apocalyptic number.
41005334031 is a deficient number, since it is larger than the sum of its proper divisors (13669663473).
41005334031 is a wasteful number, since it uses less digits than its factorization.
41005334031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304701.
The product of its (nonzero) digits is 2160, while the sum is 24.
Adding to 41005334031 its reverse (13043350014), we get a palindrome (54048684045).
The spelling of 41005334031 in words is "forty-one billion, five million, three hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •