Base | Representation |
---|---|
bin | 1001011111110000111100… |
… | …1111001101101100100001 |
3 | 1100222011212121211011220121 |
4 | 2113330033033031230201 |
5 | 2332032311203034243 |
6 | 34112402100440241 |
7 | 2125234446226222 |
oct | 227741717155441 |
9 | 40864777734817 |
10 | 10441321143073 |
11 | 3366159642837 |
12 | 12077213a9081 |
13 | 5a97c6477882 |
14 | 281511125249 |
15 | 1319092dd1ed |
hex | 97f0f3cdb21 |
10441321143073 has 2 divisors, whose sum is σ = 10441321143074. Its totient is φ = 10441321143072.
The previous prime is 10441321142983. The next prime is 10441321143091. The reversal of 10441321143073 is 37034112314401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10441247989264 + 73153809 = 3231292^2 + 8553^2 .
It is a cyclic number.
It is not a de Polignac number, because 10441321143073 - 29 = 10441321142561 is a prime.
It is a super-3 number, since 3×104413211430733 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10441321143173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5220660571536 + 5220660571537.
It is an arithmetic number, because the mean of its divisors is an integer number (5220660571537).
Almost surely, 210441321143073 is an apocalyptic number.
It is an amenable number.
10441321143073 is a deficient number, since it is larger than the sum of its proper divisors (1).
10441321143073 is an equidigital number, since it uses as much as digits as its factorization.
10441321143073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 34.
Adding to 10441321143073 its reverse (37034112314401), we get a palindrome (47475433457474).
The spelling of 10441321143073 in words is "ten trillion, four hundred forty-one billion, three hundred twenty-one million, one hundred forty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.199 sec. • engine limits •