Base | Representation |
---|---|
bin | 10010111010101111111101… |
… | …10011110101000100000001 |
3 | 12110022000112112110121100021 |
4 | 21131113332303311010001 |
5 | 20423042404003330223 |
6 | 224251130103253441 |
7 | 11522401246162321 |
oct | 1135277663650401 |
9 | 173260475417307 |
10 | 41601033261313 |
11 | 12289998815029 |
12 | 47ba685a4a281 |
13 | 1a29c645a5216 |
14 | a3b7020d1281 |
15 | 4c2211da265d |
hex | 25d5fecf5101 |
41601033261313 has 2 divisors, whose sum is σ = 41601033261314. Its totient is φ = 41601033261312.
The previous prime is 41601033261283. The next prime is 41601033261331. The reversal of 41601033261313 is 31316233010614.
Together with next prime (41601033261331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36277155394704 + 5323877866609 = 6023052^2 + 2307353^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41601033261313 is a prime.
It is not a weakly prime, because it can be changed into another prime (41601031261313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20800516630656 + 20800516630657.
It is an arithmetic number, because the mean of its divisors is an integer number (20800516630657).
Almost surely, 241601033261313 is an apocalyptic number.
It is an amenable number.
41601033261313 is a deficient number, since it is larger than the sum of its proper divisors (1).
41601033261313 is an equidigital number, since it uses as much as digits as its factorization.
41601033261313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 34.
Adding to 41601033261313 its reverse (31316233010614), we get a palindrome (72917266271927).
The spelling of 41601033261313 in words is "forty-one trillion, six hundred one billion, thirty-three million, two hundred sixty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •