Base | Representation |
---|---|
bin | 1001011101100010101001… |
… | …0101111000101001100001 |
3 | 1100211112021101211112120122 |
4 | 2113120222111320221201 |
5 | 2330421043004433131 |
6 | 34043043342450025 |
7 | 2122413016640324 |
oct | 227305225705141 |
9 | 40745241745518 |
10 | 10403121171041 |
11 | 3350a36768415 |
12 | 1200240293915 |
13 | 5a60192c5021 |
14 | 27d729a3a7bb |
15 | 130920867d7b |
hex | 9762a578a61 |
10403121171041 has 2 divisors, whose sum is σ = 10403121171042. Its totient is φ = 10403121171040.
The previous prime is 10403121171031. The next prime is 10403121171071. The reversal of 10403121171041 is 14017112130401.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8460512420416 + 1942608750625 = 2908696^2 + 1393775^2 .
It is a cyclic number.
It is not a de Polignac number, because 10403121171041 - 26 = 10403121170977 is a prime.
It is a super-2 number, since 2×104031211710412 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10403121171041.
It is not a weakly prime, because it can be changed into another prime (10403121171031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5201560585520 + 5201560585521.
It is an arithmetic number, because the mean of its divisors is an integer number (5201560585521).
Almost surely, 210403121171041 is an apocalyptic number.
It is an amenable number.
10403121171041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10403121171041 is an equidigital number, since it uses as much as digits as its factorization.
10403121171041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 26.
The spelling of 10403121171041 in words is "ten trillion, four hundred three billion, one hundred twenty-one million, one hundred seventy-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •