Base | Representation |
---|---|
bin | 1001011101101101011111… |
… | …0111110101001100001101 |
3 | 1100211210210022001210201101 |
4 | 2113123113313311030031 |
5 | 2330443023311400031 |
6 | 34044244303143101 |
7 | 2122545121032025 |
oct | 227332767651415 |
9 | 40753708053641 |
10 | 10406032528141 |
11 | 33521a0094068 |
12 | 12009132a4a91 |
13 | 5a6391511233 |
14 | 27d92456aa85 |
15 | 130a4124c361 |
hex | 976d7df530d |
10406032528141 has 2 divisors, whose sum is σ = 10406032528142. Its totient is φ = 10406032528140.
The previous prime is 10406032528039. The next prime is 10406032528147. The reversal of 10406032528141 is 14182523060401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8737876880100 + 1668155648041 = 2955990^2 + 1291571^2 .
It is a cyclic number.
It is not a de Polignac number, because 10406032528141 - 29 = 10406032527629 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10406032528141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10406032528147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5203016264070 + 5203016264071.
It is an arithmetic number, because the mean of its divisors is an integer number (5203016264071).
Almost surely, 210406032528141 is an apocalyptic number.
It is an amenable number.
10406032528141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10406032528141 is an equidigital number, since it uses as much as digits as its factorization.
10406032528141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46080, while the sum is 37.
Adding to 10406032528141 its reverse (14182523060401), we get a palindrome (24588555588542).
The spelling of 10406032528141 in words is "ten trillion, four hundred six billion, thirty-two million, five hundred twenty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •