Base | Representation |
---|---|
bin | 10010110010000001010100… |
… | …00011011001010010110001 |
3 | 12102020100101102220201121000 |
4 | 21121000222003121102301 |
5 | 20403134133412121231 |
6 | 223501245105352213 |
7 | 11461623014360223 |
oct | 1131005203312261 |
9 | 172210342821530 |
10 | 41301111051441 |
11 | 1218378051a69a |
12 | 4770522638669 |
13 | 1a078a7911b97 |
14 | a2adad43c413 |
15 | 4b950b45c6e6 |
hex | 25902a0d94b1 |
41301111051441 has 32 divisors (see below), whose sum is σ = 64904495806080. Its totient is φ = 25867046919168.
The previous prime is 41301111051427. The next prime is 41301111051443. The reversal of 41301111051441 is 14415011110314.
41301111051441 is a `hidden beast` number, since 4 + 1 + 3 + 0 + 111 + 105 + 1 + 441 = 666.
It is not a de Polignac number, because 41301111051441 - 27 = 41301111051313 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (41301111051443) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 81998136 + ... + 82500281.
It is an arithmetic number, because the mean of its divisors is an integer number (2028265493940).
Almost surely, 241301111051441 is an apocalyptic number.
It is an amenable number.
41301111051441 is a deficient number, since it is larger than the sum of its proper divisors (23603384754639).
41301111051441 is a wasteful number, since it uses less digits than its factorization.
41301111051441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164498990 (or 164498984 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 27.
Adding to 41301111051441 its reverse (14415011110314), we get a palindrome (55716122161755).
The spelling of 41301111051441 in words is "forty-one trillion, three hundred one billion, one hundred eleven million, fifty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •