Base | Representation |
---|---|
bin | 10010110010101101110101… |
… | …01010101010110010011101 |
3 | 12102022122002010221220120221 |
4 | 21121112322222222302131 |
5 | 20404032111044233201 |
6 | 223520240512041341 |
7 | 11463430216063234 |
oct | 1131267252526235 |
9 | 172278063856527 |
10 | 41325012102301 |
11 | 12192925a99994 |
12 | 4775092b33251 |
13 | 1a09c16574b25 |
14 | a2c1d987bb1b |
15 | 4b9e599054a1 |
hex | 2595baaaac9d |
41325012102301 has 2 divisors, whose sum is σ = 41325012102302. Its totient is φ = 41325012102300.
The previous prime is 41325012102299. The next prime is 41325012102313. The reversal of 41325012102301 is 10320121052314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33308469279801 + 8016542822500 = 5771349^2 + 2831350^2 .
It is a cyclic number.
It is not a de Polignac number, because 41325012102301 - 21 = 41325012102299 is a prime.
Together with 41325012102299, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41325012702301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20662506051150 + 20662506051151.
It is an arithmetic number, because the mean of its divisors is an integer number (20662506051151).
Almost surely, 241325012102301 is an apocalyptic number.
It is an amenable number.
41325012102301 is a deficient number, since it is larger than the sum of its proper divisors (1).
41325012102301 is an equidigital number, since it uses as much as digits as its factorization.
41325012102301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 41325012102301 its reverse (10320121052314), we get a palindrome (51645133154615).
The spelling of 41325012102301 in words is "forty-one trillion, three hundred twenty-five billion, twelve million, one hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •