Base | Representation |
---|---|
bin | 100110010010100001… |
… | …101110101100100101 |
3 | 10221010020101212120200 |
4 | 212102201232230211 |
5 | 1133144413134341 |
6 | 30515334421113 |
7 | 2653550625426 |
oct | 462241565445 |
9 | 127106355520 |
10 | 41113021221 |
11 | 16488257398 |
12 | 7b74801799 |
13 | 3b52841cbc |
14 | 1dc033964d |
15 | 1109590db6 |
hex | 99286eb25 |
41113021221 has 72 divisors (see below), whose sum is σ = 65341545984. Its totient is φ = 24879121920.
The previous prime is 41113021217. The next prime is 41113021247. The reversal of 41113021221 is 12212031114.
41113021221 is a `hidden beast` number, since 411 + 1 + 30 + 2 + 1 + 221 = 666.
It is not a de Polignac number, because 41113021221 - 22 = 41113021217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41113021194 and 41113021203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41113021291) 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 71 ways as a sum of consecutive naturals, for example, 30074680 + ... + 30076046.
It is an arithmetic number, because the mean of its divisors is an integer number (907521472).
Almost surely, 241113021221 is an apocalyptic number.
It is an amenable number.
41113021221 is a deficient number, since it is larger than the sum of its proper divisors (24228524763).
41113021221 is a wasteful number, since it uses less digits than its factorization.
41113021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1811 (or 1791 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 41113021221 its reverse (12212031114), we get a palindrome (53325052335).
The spelling of 41113021221 in words is "forty-one billion, one hundred thirteen million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •