Base | Representation |
---|---|
bin | 1001011000011010100111… |
… | …0100111110101111101101 |
3 | 1100112002222122221221020121 |
4 | 2112012221310332233231 |
5 | 2323000223310400233 |
6 | 33534401544444541 |
7 | 2113144641630214 |
oct | 226065164765755 |
9 | 40462878857217 |
10 | 10315065715693 |
11 | 331765a757522 |
12 | 11a7166779751 |
13 | 59a9253018ab |
14 | 2793750c007b |
15 | 12d4ba09792d |
hex | 961a9d3ebed |
10315065715693 has 2 divisors, whose sum is σ = 10315065715694. Its totient is φ = 10315065715692.
The previous prime is 10315065715681. The next prime is 10315065715723. The reversal of 10315065715693 is 39651756051301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10307676250249 + 7389465444 = 3210557^2 + 85962^2 .
It is an emirp because it is prime and its reverse (39651756051301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10315065715693 - 213 = 10315065707501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10315065715693.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10315065715193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5157532857846 + 5157532857847.
It is an arithmetic number, because the mean of its divisors is an integer number (5157532857847).
Almost surely, 210315065715693 is an apocalyptic number.
It is an amenable number.
10315065715693 is a deficient number, since it is larger than the sum of its proper divisors (1).
10315065715693 is an equidigital number, since it uses as much as digits as its factorization.
10315065715693 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2551500, while the sum is 52.
The spelling of 10315065715693 in words is "ten trillion, three hundred fifteen billion, sixty-five million, seven hundred fifteen thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •