Base | Representation |
---|---|
bin | 10010110000010000001111… |
… | …11111101011100101111001 |
3 | 12102000112201002101102101212 |
4 | 21120020013333223211321 |
5 | 20401140324442012304 |
6 | 223413325521452505 |
7 | 11454343544031353 |
oct | 1130100777534571 |
9 | 172015632342355 |
10 | 41240410110329 |
11 | 1215aa61410161 |
12 | 4760801aa1135 |
13 | 1a01c52ba6151 |
14 | a280918480d3 |
15 | 4b7b573ed66e |
hex | 258207feb979 |
41240410110329 has 2 divisors, whose sum is σ = 41240410110330. Its totient is φ = 41240410110328.
The previous prime is 41240410110323. The next prime is 41240410110353. The reversal of 41240410110329 is 92301101404214.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31967410684729 + 9272999425600 = 5653973^2 + 3045160^2 .
It is a cyclic number.
It is not a de Polignac number, because 41240410110329 - 28 = 41240410110073 is a prime.
It is a super-3 number, since 3×412404101103293 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41240410110295 and 41240410110304.
It is not a weakly prime, because it can be changed into another prime (41240410110323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20620205055164 + 20620205055165.
It is an arithmetic number, because the mean of its divisors is an integer number (20620205055165).
Almost surely, 241240410110329 is an apocalyptic number.
It is an amenable number.
41240410110329 is a deficient number, since it is larger than the sum of its proper divisors (1).
41240410110329 is an equidigital number, since it uses as much as digits as its factorization.
41240410110329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 32.
The spelling of 41240410110329 in words is "forty-one trillion, two hundred forty billion, four hundred ten million, one hundred ten thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •