Base | Representation |
---|---|
bin | 10010101101110001001111… |
… | …00110111010111011101101 |
3 | 12101201101100120121121221202 |
4 | 21112320213212322323231 |
5 | 20343241011013111212 |
6 | 223310210452335245 |
7 | 11445232166554334 |
oct | 1126704746727355 |
9 | 171641316547852 |
10 | 41155041144557 |
11 | 121278338a868a |
12 | 4748158014525 |
13 | 19c6b99648b12 |
14 | a23cb3a04d1b |
15 | 4b580c8e50c2 |
hex | 256e279baeed |
41155041144557 has 2 divisors, whose sum is σ = 41155041144558. Its totient is φ = 41155041144556.
The previous prime is 41155041144499. The next prime is 41155041144559. The reversal of 41155041144557 is 75544114055114.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35486099194441 + 5668941950116 = 5957021^2 + 2380954^2 .
It is a cyclic number.
It is not a de Polignac number, because 41155041144557 - 224 = 41155024367341 is a prime.
It is a super-2 number, since 2×411550411445572 (a number of 28 digits) contains 22 as substring.
Together with 41155041144559, 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 (41155041144559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20577520572278 + 20577520572279.
It is an arithmetic number, because the mean of its divisors is an integer number (20577520572279).
Almost surely, 241155041144557 is an apocalyptic number.
It is an amenable number.
41155041144557 is a deficient number, since it is larger than the sum of its proper divisors (1).
41155041144557 is an equidigital number, since it uses as much as digits as its factorization.
41155041144557 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1120000, while the sum is 47.
The spelling of 41155041144557 in words is "forty-one trillion, one hundred fifty-five billion, forty-one million, one hundred forty-four thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •