Base | Representation |
---|---|
bin | 100110010010110010… |
… | …101111011000111001 |
3 | 10221010112210102120100 |
4 | 212102302233120321 |
5 | 1133202033334010 |
6 | 30520014150013 |
7 | 2653633550313 |
oct | 462262573071 |
9 | 127115712510 |
10 | 41117480505 |
11 | 1648a822752 |
12 | 7b761b2309 |
13 | 3b5374392a |
14 | 1dc0b7a7b3 |
15 | 1109b722c0 |
hex | 992caf639 |
41117480505 has 48 divisors (see below), whose sum is σ = 72151560000. Its totient is φ = 21659826048.
The previous prime is 41117480501. The next prime is 41117480519. The reversal of 41117480505 is 50508471114.
41117480505 is a `hidden beast` number, since 4 + 1 + 1 + 1 + 74 + 80 + 505 = 666.
It is not a de Polignac number, because 41117480505 - 22 = 41117480501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 41117480505.
It is not an unprimeable number, because it can be changed into a prime (41117480501) 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 47 ways as a sum of consecutive naturals, for example, 1183066 + ... + 1217324.
It is an arithmetic number, because the mean of its divisors is an integer number (1503157500).
Almost surely, 241117480505 is an apocalyptic number.
41117480505 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
41117480505 is a deficient number, since it is larger than the sum of its proper divisors (31034079495).
41117480505 is a wasteful number, since it uses less digits than its factorization.
41117480505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34598 (or 34595 counting only the distinct ones).
The product of its (nonzero) digits is 22400, while the sum is 36.
The spelling of 41117480505 in words is "forty-one billion, one hundred seventeen million, four hundred eighty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •