Base | Representation |
---|---|
bin | 1001011000111101100000… |
… | …0011000110100001001101 |
3 | 1100120000011100120221220001 |
4 | 2112033120003012201031 |
5 | 2323123413330312302 |
6 | 33542551141324301 |
7 | 2113626012256426 |
oct | 226173003064115 |
9 | 40500140527801 |
10 | 10324431104077 |
11 | 3320626223422 |
12 | 11a8b3b106691 |
13 | 59b78869541c |
14 | 2799c2c4a64d |
15 | 12d86739c787 |
hex | 963d80c684d |
10324431104077 has 2 divisors, whose sum is σ = 10324431104078. Its totient is φ = 10324431104076.
The previous prime is 10324431104023. The next prime is 10324431104083. The reversal of 10324431104077 is 77040113442301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7536018722761 + 2788412381316 = 2745181^2 + 1669854^2 .
It is a cyclic number.
It is not a de Polignac number, because 10324431104077 - 223 = 10324422715469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10324431107077) 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, 5162215552038 + 5162215552039.
It is an arithmetic number, because the mean of its divisors is an integer number (5162215552039).
Almost surely, 210324431104077 is an apocalyptic number.
It is an amenable number.
10324431104077 is a deficient number, since it is larger than the sum of its proper divisors (1).
10324431104077 is an equidigital number, since it uses as much as digits as its factorization.
10324431104077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56448, while the sum is 37.
Adding to 10324431104077 its reverse (77040113442301), we get a palindrome (87364544546378).
The spelling of 10324431104077 in words is "ten trillion, three hundred twenty-four billion, four hundred thirty-one million, one hundred four thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •