Base | Representation |
---|---|
bin | 10010110000111110001100… |
… | …10001011000011101000101 |
3 | 12102002220101011222100201201 |
4 | 21120133012101120131011 |
5 | 20402041334234224203 |
6 | 223432525332222501 |
7 | 11456206040235055 |
oct | 1130370621303505 |
9 | 172086334870651 |
10 | 41265077258053 |
11 | 1216a46a374360 |
12 | 4765546a6aa31 |
13 | 1a0438447b54c |
14 | a29351909565 |
15 | 4b85ecc72e1d |
hex | 2587c6458745 |
41265077258053 has 32 divisors (see below), whose sum is σ = 45412249259520. Its totient is φ = 37185442882560.
The previous prime is 41265077258033. The next prime is 41265077258087. The reversal of 41265077258053 is 35085277056214.
It is a cyclic number.
It is not a de Polignac number, because 41265077258053 - 217 = 41265077126981 is a prime.
It is a super-3 number, since 3×412650772580533 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 41265077257985 and 41265077258003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41265077258003) 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, 1039167163 + ... + 1039206871.
It is an arithmetic number, because the mean of its divisors is an integer number (1419132789360).
Almost surely, 241265077258053 is an apocalyptic number.
It is an amenable number.
41265077258053 is a deficient number, since it is larger than the sum of its proper divisors (4147172001467).
41265077258053 is a wasteful number, since it uses less digits than its factorization.
41265077258053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41677.
The product of its (nonzero) digits is 14112000, while the sum is 55.
The spelling of 41265077258053 in words is "forty-one trillion, two hundred sixty-five billion, seventy-seven million, two hundred fifty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •