Base | Representation |
---|---|
bin | 1001011000011011100000… |
… | …0001111110011000101101 |
3 | 1100112010121021100012010202 |
4 | 2112012320001332120231 |
5 | 2323001220311044432 |
6 | 33534441340043245 |
7 | 2113153564220561 |
oct | 226067001763055 |
9 | 40463537305122 |
10 | 10315304003117 |
11 | 3317772210383 |
12 | 11a7212533525 |
13 | 59a9627a3079 |
14 | 2793989cb6a1 |
15 | 12d4d0e66462 |
hex | 961b807e62d |
10315304003117 has 2 divisors, whose sum is σ = 10315304003118. Its totient is φ = 10315304003116.
The previous prime is 10315304003087. The next prime is 10315304003129. The reversal of 10315304003117 is 71130040351301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9887370847561 + 427933155556 = 3144419^2 + 654166^2 .
It is a cyclic number.
It is not a de Polignac number, because 10315304003117 - 234 = 10298124133933 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10315304003117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10315304003317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5157652001558 + 5157652001559.
It is an arithmetic number, because the mean of its divisors is an integer number (5157652001559).
Almost surely, 210315304003117 is an apocalyptic number.
It is an amenable number.
10315304003117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10315304003117 is an equidigital number, since it uses as much as digits as its factorization.
10315304003117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 29.
Adding to 10315304003117 its reverse (71130040351301), we get a palindrome (81445344354418).
The spelling of 10315304003117 in words is "ten trillion, three hundred fifteen billion, three hundred four million, three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •