Base | Representation |
---|---|
bin | 1001011001111011001110… |
… | …1101011111111001000001 |
3 | 1100121120221011101122221012 |
4 | 2112132303231133321001 |
5 | 2323411332320031431 |
6 | 33554331311010305 |
7 | 2115053440001621 |
oct | 226366355377101 |
9 | 40546834348835 |
10 | 10341001330241 |
11 | 332765973060a |
12 | 11b01a4509995 |
13 | 5a01c962118a |
14 | 27a715814881 |
15 | 12ded6e7e22b |
hex | 967b3b5fe41 |
10341001330241 has 2 divisors, whose sum is σ = 10341001330242. Its totient is φ = 10341001330240.
The previous prime is 10341001330213. The next prime is 10341001330267. The reversal of 10341001330241 is 14203310014301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9499371231025 + 841630099216 = 3082105^2 + 917404^2 .
It is a cyclic number.
It is not a de Polignac number, because 10341001330241 - 226 = 10340934221377 is a prime.
It is a super-2 number, since 2×103410013302412 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10341001830241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5170500665120 + 5170500665121.
It is an arithmetic number, because the mean of its divisors is an integer number (5170500665121).
Almost surely, 210341001330241 is an apocalyptic number.
It is an amenable number.
10341001330241 is a deficient number, since it is larger than the sum of its proper divisors (1).
10341001330241 is an equidigital number, since it uses as much as digits as its factorization.
10341001330241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10341001330241 its reverse (14203310014301), we get a palindrome (24544311344542).
The spelling of 10341001330241 in words is "ten trillion, three hundred forty-one billion, one million, three hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •