Base | Representation |
---|---|
bin | 10010101001010010110000… |
… | …11101111010001010100001 |
3 | 12101011200101001110202112122 |
4 | 21110221120131322022201 |
5 | 20333231020430334131 |
6 | 223111413252034025 |
7 | 11431146000015350 |
oct | 1124513035721241 |
9 | 171150331422478 |
10 | 41001242043041 |
11 | 12078590262315 |
12 | 4722395002915 |
13 | 19b5528c881c7 |
14 | a1a683877997 |
15 | 4b180a525d7b |
hex | 254a5877a2a1 |
41001242043041 has 32 divisors (see below), whose sum is σ = 46981772513280. Its totient is φ = 35051693410944.
The previous prime is 41001242043031. The next prime is 41001242043067. The reversal of 41001242043041 is 14034024210014.
It is not a de Polignac number, because 41001242043041 - 26 = 41001242042977 is a prime.
It is a super-2 number, since 2×410012420430412 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41001242043041.
It is not an unprimeable number, because it can be changed into a prime (41001242043031) 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, 19627209125 + ... + 19627211213.
It is an arithmetic number, because the mean of its divisors is an integer number (1468180391040).
Almost surely, 241001242043041 is an apocalyptic number.
It is an amenable number.
41001242043041 is a deficient number, since it is larger than the sum of its proper divisors (5980530470239).
41001242043041 is a wasteful number, since it uses less digits than its factorization.
41001242043041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6365.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 41001242043041 its reverse (14034024210014), we get a palindrome (55035266253055).
The spelling of 41001242043041 in words is "forty-one trillion, one billion, two hundred forty-two million, forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •