Base | Representation |
---|---|
bin | 1001011111110111100101… |
… | …1110111100001000100001 |
3 | 1100222100110211220221012011 |
4 | 2113331321132330020201 |
5 | 2332044434013302322 |
6 | 34113255014032521 |
7 | 2125326562256341 |
oct | 227757136741041 |
9 | 40870424827164 |
10 | 10443103650337 |
11 | 3366993839936 |
12 | 1207b3a348741 |
13 | 5a9a1b8517b7 |
14 | 28163db66d21 |
15 | 1319b0a3d677 |
hex | 97f797bc221 |
10443103650337 has 2 divisors, whose sum is σ = 10443103650338. Its totient is φ = 10443103650336.
The previous prime is 10443103650323. The next prime is 10443103650341. The reversal of 10443103650337 is 73305630134401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10341086651536 + 102016998801 = 3215756^2 + 319401^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10443103650337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10443103650337.
It is not a weakly prime, because it can be changed into another prime (10443103650037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5221551825168 + 5221551825169.
It is an arithmetic number, because the mean of its divisors is an integer number (5221551825169).
Almost surely, 210443103650337 is an apocalyptic number.
It is an amenable number.
10443103650337 is a deficient number, since it is larger than the sum of its proper divisors (1).
10443103650337 is an equidigital number, since it uses as much as digits as its factorization.
10443103650337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 40.
Adding to 10443103650337 its reverse (73305630134401), we get a palindrome (83748733784738).
The spelling of 10443103650337 in words is "ten trillion, four hundred forty-three billion, one hundred three million, six hundred fifty thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •