Base | Representation |
---|---|
bin | 100110001110010000… |
… | …001110000010001000 |
3 | 10220221020111011220102 |
4 | 212032100032002020 |
5 | 1133023034301440 |
6 | 30504253544532 |
7 | 2652020324231 |
oct | 461620160210 |
9 | 126836434812 |
10 | 41041322120 |
11 | 16450835837 |
12 | 7b547a5148 |
13 | 3b40a29cb6 |
14 | 1db49d4088 |
15 | 110312bb15 |
hex | 98e40e088 |
41041322120 has 16 divisors (see below), whose sum is σ = 92342974860. Its totient is φ = 16416528832.
The previous prime is 41041322083. The next prime is 41041322129. The reversal of 41041322120 is 2122314014.
It can be written as a sum of positive squares in 2 ways, for example, as 35367315844 + 5674006276 = 188062^2 + 75326^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 41041322092 and 41041322101.
It is not an unprimeable number, because it can be changed into a prime (41041322129) 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, 513016487 + ... + 513016566.
Almost surely, 241041322120 is an apocalyptic number.
41041322120 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41041322120 is an abundant number, since it is smaller than the sum of its proper divisors (51301652740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41041322120 is a wasteful number, since it uses less digits than its factorization.
41041322120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1026033064 (or 1026033060 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 41041322120 its reverse (2122314014), we get a palindrome (43163636134).
The spelling of 41041322120 in words is "forty-one billion, forty-one million, three hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •