Base | Representation |
---|---|
bin | 100110101010011111… |
… | …101101011101010001 |
3 | 10222011021001212202111 |
4 | 212222133231131101 |
5 | 1140010334120131 |
6 | 31023301345321 |
7 | 2666532624166 |
oct | 465237553521 |
9 | 128137055674 |
10 | 41515145041 |
11 | 16674242a27 |
12 | 8067408241 |
13 | 3bb7c481a6 |
14 | 201b8d406d |
15 | 112ea23ab1 |
hex | 9aa7ed751 |
41515145041 has 4 divisors (see below), whose sum is σ = 42083845732. Its totient is φ = 40946444352.
The previous prime is 41515145029. The next prime is 41515145051. The reversal of 41515145041 is 14054151514.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 24023760016 + 17491385025 = 154996^2 + 132255^2 .
It is a cyclic number.
It is not a de Polignac number, because 41515145041 - 211 = 41515142993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41515144994 and 41515145012.
It is not an unprimeable number, because it can be changed into a prime (41515145051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 284350236 + ... + 284350381.
It is an arithmetic number, because the mean of its divisors is an integer number (10520961433).
Almost surely, 241515145041 is an apocalyptic number.
It is an amenable number.
41515145041 is a deficient number, since it is larger than the sum of its proper divisors (568700691).
41515145041 is an equidigital number, since it uses as much as digits as its factorization.
41515145041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568700690.
The product of its (nonzero) digits is 8000, while the sum is 31.
Adding to 41515145041 its reverse (14054151514), we get a palindrome (55569296555).
The spelling of 41515145041 in words is "forty-one billion, five hundred fifteen million, one hundred forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •