Base | Representation |
---|---|
bin | 1001011000111100000000… |
… | …1101101000011010100101 |
3 | 1100112222010111010021221202 |
4 | 2112033000031220122211 |
5 | 2323122103442224143 |
6 | 33542443334252245 |
7 | 2113613055242051 |
oct | 226170015503245 |
9 | 40488114107852 |
10 | 10324031211173 |
11 | 3320440520a19 |
12 | 11a8a491b7085 |
13 | 59b7238907c4 |
14 | 279985ab2c61 |
15 | 12d84220aab8 |
hex | 963c03686a5 |
10324031211173 has 2 divisors, whose sum is σ = 10324031211174. Its totient is φ = 10324031211172.
The previous prime is 10324031211133. The next prime is 10324031211283. The reversal of 10324031211173 is 37111213042301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7170061223809 + 3153969987364 = 2677697^2 + 1775942^2 .
It is a cyclic number.
It is not a de Polignac number, because 10324031211173 - 228 = 10323762775717 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10324031211133) 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, 5162015605586 + 5162015605587.
It is an arithmetic number, because the mean of its divisors is an integer number (5162015605587).
Almost surely, 210324031211173 is an apocalyptic number.
It is an amenable number.
10324031211173 is a deficient number, since it is larger than the sum of its proper divisors (1).
10324031211173 is an equidigital number, since it uses as much as digits as its factorization.
10324031211173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 29.
Adding to 10324031211173 its reverse (37111213042301), we get a palindrome (47435244253474).
The spelling of 10324031211173 in words is "ten trillion, three hundred twenty-four billion, thirty-one million, two hundred eleven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •