Base | Representation |
---|---|
bin | 1001011000010011101111… |
… | …1100001100011111111001 |
3 | 1100111221020011220020011111 |
4 | 2112010323330030133321 |
5 | 2322432434330111043 |
6 | 33533455010000321 |
7 | 2113051154362102 |
oct | 226047374143771 |
9 | 40457204806144 |
10 | 10313222113273 |
11 | 33168a4021762 |
12 | 11a69312760a1 |
13 | 59a6c03863a1 |
14 | 27923c2d73a9 |
15 | 12d40d2ca09d |
hex | 9613bf0c7f9 |
10313222113273 has 2 divisors, whose sum is σ = 10313222113274. Its totient is φ = 10313222113272.
The previous prime is 10313222113237. The next prime is 10313222113297. The reversal of 10313222113273 is 37231122231301.
Together with previous prime (10313222113237) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6657447521209 + 3655774592064 = 2580203^2 + 1912008^2 .
It is a cyclic number.
It is not a de Polignac number, because 10313222113273 - 29 = 10313222112761 is a prime.
It is not a weakly prime, because it can be changed into another prime (10313222113573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156611056636 + 5156611056637.
It is an arithmetic number, because the mean of its divisors is an integer number (5156611056637).
Almost surely, 210313222113273 is an apocalyptic number.
It is an amenable number.
10313222113273 is a deficient number, since it is larger than the sum of its proper divisors (1).
10313222113273 is an equidigital number, since it uses as much as digits as its factorization.
10313222113273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 31.
Adding to 10313222113273 its reverse (37231122231301), we get a palindrome (47544344344574).
The spelling of 10313222113273 in words is "ten trillion, three hundred thirteen billion, two hundred twenty-two million, one hundred thirteen thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •