Base | Representation |
---|---|
bin | 100110101000100001… |
… | …000111101100111001 |
3 | 10222001221121220210010 |
4 | 212220201013230321 |
5 | 1134423340211444 |
6 | 31020114212133 |
7 | 2665650562422 |
oct | 465041075471 |
9 | 128057556703 |
10 | 41481960249 |
11 | 16657537784 |
12 | 8058284049 |
13 | 3bb10c9712 |
14 | 2017336649 |
15 | 112bb6b2b9 |
hex | 9a8847b39 |
41481960249 has 16 divisors (see below), whose sum is σ = 55971216000. Its totient is φ = 27324122496.
The previous prime is 41481960239. The next prime is 41481960259. The reversal of 41481960249 is 94206918414.
It is an interprime number because it is at equal distance from previous prime (41481960239) and next prime (41481960259).
It is not a de Polignac number, because 41481960249 - 29 = 41481959737 is a prime.
It is a super-2 number, since 2×414819602492 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 41481960198 and 41481960207.
It is not an unprimeable number, because it can be changed into a prime (41481960229) 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 15 ways as a sum of consecutive naturals, for example, 318007 + ... + 429059.
It is an arithmetic number, because the mean of its divisors is an integer number (3498201000).
Almost surely, 241481960249 is an apocalyptic number.
It is an amenable number.
41481960249 is a deficient number, since it is larger than the sum of its proper divisors (14489255751).
41481960249 is a wasteful number, since it uses less digits than its factorization.
41481960249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112544.
The product of its (nonzero) digits is 497664, while the sum is 48.
The spelling of 41481960249 in words is "forty-one billion, four hundred eighty-one million, nine hundred sixty thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •