Base | Representation |
---|---|
bin | 100110001111011010… |
… | …110000001001011001 |
3 | 10220222121020211112022 |
4 | 212033122300021121 |
5 | 1133043040014010 |
6 | 30510232424225 |
7 | 2652345361400 |
oct | 461732601131 |
9 | 126877224468 |
10 | 41060860505 |
11 | 16460870265 |
12 | 7b5b248075 |
13 | 3b44aab282 |
14 | 1db743c637 |
15 | 1104bdad55 |
hex | 98f6b0259 |
41060860505 has 36 divisors (see below), whose sum is σ = 57712517100. Its totient is φ = 27963347328.
The previous prime is 41060860483. The next prime is 41060860507. The reversal of 41060860505 is 50506806014.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 4136547856 + 36924312649 = 64316^2 + 192157^2 .
It is not a de Polignac number, because 41060860505 - 222 = 41056666201 is a prime.
It is a super-2 number, since 2×410608605052 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is not an unprimeable number, because it can be changed into a prime (41060860507) 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 35 ways as a sum of consecutive naturals, for example, 5435471 + ... + 5443019.
It is an arithmetic number, because the mean of its divisors is an integer number (1603125475).
Almost surely, 241060860505 is an apocalyptic number.
It is an amenable number.
41060860505 is a deficient number, since it is larger than the sum of its proper divisors (16651656595).
41060860505 is an equidigital number, since it uses as much as digits as its factorization.
41060860505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7866 (or 7710 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 35.
The spelling of 41060860505 in words is "forty-one billion, sixty million, eight hundred sixty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •