Base | Representation |
---|---|
bin | 100110100000000111… |
… | …100011011010111001 |
3 | 10221201010110102222020 |
4 | 212200013203122321 |
5 | 1134131301242223 |
6 | 30554121545053 |
7 | 2662320021216 |
oct | 464007433271 |
9 | 127633412866 |
10 | 41341040313 |
11 | 16594a37521 |
12 | 8019045189 |
13 | 3b8ab59741 |
14 | 2002732b0d |
15 | 111e5d21e3 |
hex | 9a01e36b9 |
41341040313 has 32 divisors (see below), whose sum is σ = 58474536960. Its totient is φ = 25907506560.
The previous prime is 41341040287. The next prime is 41341040339. The reversal of 41341040313 is 31304014314.
It is an interprime number because it is at equal distance from previous prime (41341040287) and next prime (41341040339).
It is not a de Polignac number, because 41341040313 - 216 = 41340974777 is a prime.
It is a super-2 number, since 2×413410403132 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (41341042313) 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 31 ways as a sum of consecutive naturals, for example, 3973348 + ... + 3983738.
It is an arithmetic number, because the mean of its divisors is an integer number (1827329280).
Almost surely, 241341040313 is an apocalyptic number.
It is an amenable number.
41341040313 is a deficient number, since it is larger than the sum of its proper divisors (17133496647).
41341040313 is a wasteful number, since it uses less digits than its factorization.
41341040313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10949.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 41341040313 its reverse (31304014314), we get a palindrome (72645054627).
The spelling of 41341040313 in words is "forty-one billion, three hundred forty-one million, forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •