Base | Representation |
---|---|
bin | 10010101001011100100000… |
… | …11111111111110101100101 |
3 | 12101012011212220010021212212 |
4 | 21110232100133333311211 |
5 | 20333322231113110312 |
6 | 223114040541053205 |
7 | 11431422505063442 |
oct | 1124562037776545 |
9 | 171164786107785 |
10 | 41006477081957 |
11 | 1207a827304562 |
12 | 47233b6257205 |
13 | 19b5b8171b77a |
14 | a1aa1cc3c9c9 |
15 | 4b1a14e08822 |
hex | 254b907ffd65 |
41006477081957 has 2 divisors, whose sum is σ = 41006477081958. Its totient is φ = 41006477081956.
The previous prime is 41006477081873. The next prime is 41006477082017. The reversal of 41006477081957 is 75918077460014.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41003032096321 + 3444985636 = 6403361^2 + 58694^2 .
It is a cyclic number.
It is not a de Polignac number, because 41006477081957 - 230 = 41005403340133 is a prime.
It is a super-3 number, since 3×410064770819573 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41006477081896 and 41006477081905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41006477081057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20503238540978 + 20503238540979.
It is an arithmetic number, because the mean of its divisors is an integer number (20503238540979).
Almost surely, 241006477081957 is an apocalyptic number.
It is an amenable number.
41006477081957 is a deficient number, since it is larger than the sum of its proper divisors (1).
41006477081957 is an equidigital number, since it uses as much as digits as its factorization.
41006477081957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11854080, while the sum is 59.
The spelling of 41006477081957 in words is "forty-one trillion, six billion, four hundred seventy-seven million, eighty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •