Base | Representation |
---|---|
bin | 1001011010000010110101… |
… | …0011000100101000101101 |
3 | 1100121210012022210222000202 |
4 | 2112200231103010220231 |
5 | 2323430022023120323 |
6 | 33555305541003245 |
7 | 2115155126544506 |
oct | 226405523045055 |
9 | 40553168728022 |
10 | 10343041223213 |
11 | 3328506145376 |
12 | 11b06736b3525 |
13 | 5a046312543a |
14 | 27a86a6d5bad |
15 | 12e0a60c1d28 |
hex | 9682d4c4a2d |
10343041223213 has 2 divisors, whose sum is σ = 10343041223214. Its totient is φ = 10343041223212.
The previous prime is 10343041223209. The next prime is 10343041223233. The reversal of 10343041223213 is 31232214034301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9124253927044 + 1218787296169 = 3020638^2 + 1103987^2 .
It is a cyclic number.
It is not a de Polignac number, because 10343041223213 - 22 = 10343041223209 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10343041223233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5171520611606 + 5171520611607.
It is an arithmetic number, because the mean of its divisors is an integer number (5171520611607).
Almost surely, 210343041223213 is an apocalyptic number.
It is an amenable number.
10343041223213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10343041223213 is an equidigital number, since it uses as much as digits as its factorization.
10343041223213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 10343041223213 its reverse (31232214034301), we get a palindrome (41575255257514).
The spelling of 10343041223213 in words is "ten trillion, three hundred forty-three billion, forty-one million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •