Base | Representation |
---|---|
bin | 1001011110000001010001… |
… | …1001110010101101001001 |
3 | 1100212022111101201022021122 |
4 | 2113200110121302231021 |
5 | 2331034412303443423 |
6 | 34050523245445025 |
7 | 2123123533412003 |
oct | 227402431625511 |
9 | 40768441638248 |
10 | 10411343031113 |
11 | 33544757995a2 |
12 | 1201955870775 |
13 | 5a6a297a739b |
14 | 27dca9977373 |
15 | 130c525898c8 |
hex | 97814672b49 |
10411343031113 has 2 divisors, whose sum is σ = 10411343031114. Its totient is φ = 10411343031112.
The previous prime is 10411343031101. The next prime is 10411343031139. The reversal of 10411343031113 is 31113034311401.
It is an a-pointer prime, because the next prime (10411343031139) can be obtained adding 10411343031113 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10240684811449 + 170658219664 = 3200107^2 + 413108^2 .
It is a cyclic number.
It is not a de Polignac number, because 10411343031113 - 212 = 10411343027017 is a prime.
It is not a weakly prime, because it can be changed into another prime (10411343031163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5205671515556 + 5205671515557.
It is an arithmetic number, because the mean of its divisors is an integer number (5205671515557).
Almost surely, 210411343031113 is an apocalyptic number.
It is an amenable number.
10411343031113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10411343031113 is an equidigital number, since it uses as much as digits as its factorization.
10411343031113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 10411343031113 its reverse (31113034311401), we get a palindrome (41524377342514).
The spelling of 10411343031113 in words is "ten trillion, four hundred eleven billion, three hundred forty-three million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •