Base | Representation |
---|---|
bin | 1001011110001001000011… |
… | …0011010110000010000001 |
3 | 1100212111212211220121022121 |
4 | 2113202100303112002001 |
5 | 2331103201101313233 |
6 | 34051510323004241 |
7 | 2123226335266114 |
oct | 227422063260201 |
9 | 40774784817277 |
10 | 10413430104193 |
11 | 33553468a8486 |
12 | 1202238809681 |
13 | 5a6c9ccba37c |
14 | 280026c1a57b |
15 | 130d258eb92d |
hex | 97890cd6081 |
10413430104193 has 2 divisors, whose sum is σ = 10413430104194. Its totient is φ = 10413430104192.
The previous prime is 10413430104163. The next prime is 10413430104197. The reversal of 10413430104193 is 39140103431401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9484872381504 + 928557722689 = 3079752^2 + 963617^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10413430104193 is a prime.
It is not a weakly prime, because it can be changed into another prime (10413430104197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5206715052096 + 5206715052097.
It is an arithmetic number, because the mean of its divisors is an integer number (5206715052097).
Almost surely, 210413430104193 is an apocalyptic number.
It is an amenable number.
10413430104193 is a deficient number, since it is larger than the sum of its proper divisors (1).
10413430104193 is an equidigital number, since it uses as much as digits as its factorization.
10413430104193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
Adding to 10413430104193 its reverse (39140103431401), we get a palindrome (49553533535594).
The spelling of 10413430104193 in words is "ten trillion, four hundred thirteen billion, four hundred thirty million, one hundred four thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •