Base | Representation |
---|---|
bin | 10010111000001111010000… |
… | …11000110110000001000001 |
3 | 12102222202211211212011010102 |
4 | 21130013220120312001001 |
5 | 20420134210440231112 |
6 | 224143341051412145 |
7 | 11513225253315053 |
oct | 1134075030660101 |
9 | 172882754764112 |
10 | 41514757742657 |
11 | 122563455049a1 |
12 | 47a5a08454055 |
13 | 1a21a95298974 |
14 | a37479b078d3 |
15 | 4bed629c5bc2 |
hex | 25c1e8636041 |
41514757742657 has 2 divisors, whose sum is σ = 41514757742658. Its totient is φ = 41514757742656.
The previous prime is 41514757742617. The next prime is 41514757742671. The reversal of 41514757742657 is 75624775741514.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23318313841216 + 18196443901441 = 4828904^2 + 4265729^2 .
It is a cyclic number.
It is not a de Polignac number, because 41514757742657 - 216 = 41514757677121 is a prime.
It is a super-2 number, since 2×415147577426572 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41514757742593 and 41514757742602.
It is not a weakly prime, because it can be changed into another prime (41514757742617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20757378871328 + 20757378871329.
It is an arithmetic number, because the mean of its divisors is an integer number (20757378871329).
Almost surely, 241514757742657 is an apocalyptic number.
It is an amenable number.
41514757742657 is a deficient number, since it is larger than the sum of its proper divisors (1).
41514757742657 is an equidigital number, since it uses as much as digits as its factorization.
41514757742657 is an evil number, because the sum of its binary digits is even.
The product of its digits is 230496000, while the sum is 65.
The spelling of 41514757742657 in words is "forty-one trillion, five hundred fourteen billion, seven hundred fifty-seven million, seven hundred forty-two thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •