Base | Representation |
---|---|
bin | 10010101010000000001010… |
… | …01011000111010100111101 |
3 | 12101021000021121101100010222 |
4 | 21111000011023013110331 |
5 | 20334130424242123234 |
6 | 223130523532311125 |
7 | 11433000653514041 |
oct | 1125000513072475 |
9 | 171230247340128 |
10 | 41025614411069 |
11 | 12087957888132 |
12 | 47270573124a5 |
13 | 19b791146c952 |
14 | a1b916724021 |
15 | 4b228506d42e |
hex | 2550052c753d |
41025614411069 has 2 divisors, whose sum is σ = 41025614411070. Its totient is φ = 41025614411068.
The previous prime is 41025614410999. The next prime is 41025614411071. The reversal of 41025614411069 is 96011441652014.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22358116462969 + 18667497948100 = 4728437^2 + 4320590^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41025614411069 is a prime.
It is a super-2 number, since 2×410256144110692 (a number of 28 digits) contains 22 as substring.
Together with 41025614411071, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41025614414069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20512807205534 + 20512807205535.
It is an arithmetic number, because the mean of its divisors is an integer number (20512807205535).
Almost surely, 241025614411069 is an apocalyptic number.
It is an amenable number.
41025614411069 is a deficient number, since it is larger than the sum of its proper divisors (1).
41025614411069 is an equidigital number, since it uses as much as digits as its factorization.
41025614411069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 207360, while the sum is 44.
The spelling of 41025614411069 in words is "forty-one trillion, twenty-five billion, six hundred fourteen million, four hundred eleven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •