Base | Representation |
---|---|
bin | 10010110010101110000000… |
… | …00010100011110101001101 |
3 | 12102022122022102120221211021 |
4 | 21121113000002203311031 |
5 | 20404032302134020331 |
6 | 223520253452154141 |
7 | 11463432362246356 |
oct | 1131270002436515 |
9 | 172278272527737 |
10 | 41325102251341 |
11 | 12192971972227 |
12 | 47750b9168951 |
13 | 1a09c2c14985c |
14 | a2c207826d2d |
15 | 4b9e627b1211 |
hex | 2595c00a3d4d |
41325102251341 has 2 divisors, whose sum is σ = 41325102251342. Its totient is φ = 41325102251340.
The previous prime is 41325102251339. The next prime is 41325102251383. The reversal of 41325102251341 is 14315220152314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39926866950441 + 1398235300900 = 6318771^2 + 1182470^2 .
It is a cyclic number.
It is not a de Polignac number, because 41325102251341 - 21 = 41325102251339 is a prime.
Together with 41325102251339, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 41325102251297 and 41325102251306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41325102251441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20662551125670 + 20662551125671.
It is an arithmetic number, because the mean of its divisors is an integer number (20662551125671).
Almost surely, 241325102251341 is an apocalyptic number.
It is an amenable number.
41325102251341 is a deficient number, since it is larger than the sum of its proper divisors (1).
41325102251341 is an equidigital number, since it uses as much as digits as its factorization.
41325102251341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28800, while the sum is 34.
The spelling of 41325102251341 in words is "forty-one trillion, three hundred twenty-five billion, one hundred two million, two hundred fifty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •