Base | Representation |
---|---|
bin | 10010111111011010101001… |
… | …00001010001101111011001 |
3 | 12110212100102201121101022002 |
4 | 21133231110201101233121 |
5 | 20433204304031403234 |
6 | 224452525422210345 |
7 | 11540106023543123 |
oct | 1137552441215731 |
9 | 173770381541262 |
10 | 41761385028569 |
11 | 123409a414a128 |
12 | 48257774239b5 |
13 | 1a3c10a69653b |
14 | a45394612213 |
15 | 4c649967727e |
hex | 25fb54851bd9 |
41761385028569 has 2 divisors, whose sum is σ = 41761385028570. Its totient is φ = 41761385028568.
The previous prime is 41761385028557. The next prime is 41761385028599. The reversal of 41761385028569 is 96582058316714.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30689528074969 + 11071856953600 = 5539813^2 + 3327440^2 .
It is a cyclic number.
It is not a de Polignac number, because 41761385028569 - 24 = 41761385028553 is a prime.
It is a super-2 number, since 2×417613850285692 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (41761385028599) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20880692514284 + 20880692514285.
It is an arithmetic number, because the mean of its divisors is an integer number (20880692514285).
It is a 1-persistent number, because it is pandigital, but 2⋅41761385028569 = 83522770057138 is not.
Almost surely, 241761385028569 is an apocalyptic number.
It is an amenable number.
41761385028569 is a deficient number, since it is larger than the sum of its proper divisors (1).
41761385028569 is an equidigital number, since it uses as much as digits as its factorization.
41761385028569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87091200, while the sum is 65.
The spelling of 41761385028569 in words is "forty-one trillion, seven hundred sixty-one billion, three hundred eighty-five million, twenty-eight thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •