Base | Representation |
---|---|
bin | 10011001001010111100011… |
… | …00100100100010000011101 |
3 | 12112002001000220222001200202 |
4 | 21210223301210210100131 |
5 | 21004310101004031031 |
6 | 225313555501233245 |
7 | 11603602401625022 |
oct | 1144536144442035 |
9 | 175061026861622 |
10 | 42103322330141 |
11 | 12462a11907846 |
12 | 487baa5562825 |
13 | 1a65431a3b797 |
14 | a57b51339549 |
15 | 4d030d9482cb |
hex | 264af192441d |
42103322330141 has 2 divisors, whose sum is σ = 42103322330142. Its totient is φ = 42103322330140.
The previous prime is 42103322330099. The next prime is 42103322330159. The reversal of 42103322330141 is 14103322330124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32071596386041 + 10031725944100 = 5663179^2 + 3167290^2 .
It is a cyclic number.
It is not a de Polignac number, because 42103322330141 - 238 = 41828444423197 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42103322330161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21051661165070 + 21051661165071.
It is an arithmetic number, because the mean of its divisors is an integer number (21051661165071).
Almost surely, 242103322330141 is an apocalyptic number.
It is an amenable number.
42103322330141 is a deficient number, since it is larger than the sum of its proper divisors (1).
42103322330141 is an equidigital number, since it uses as much as digits as its factorization.
42103322330141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 42103322330141 its reverse (14103322330124), we get a palindrome (56206644660265).
The spelling of 42103322330141 in words is "forty-two trillion, one hundred three billion, three hundred twenty-two million, three hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •