Base | Representation |
---|---|
bin | 10011001110011111… |
… | …01100010001000001 |
3 | 222122100212002001122 |
4 | 21213033230101001 |
5 | 132114424220223 |
6 | 4424130242025 |
7 | 513535261556 |
oct | 114717542101 |
9 | 28570762048 |
10 | 10322101313 |
11 | 4417614547 |
12 | 2000a26315 |
13 | c86655c74 |
14 | 6dcc4aa2d |
15 | 4062d55c8 |
hex | 2673ec441 |
10322101313 has 2 divisors, whose sum is σ = 10322101314. Its totient is φ = 10322101312.
The previous prime is 10322101303. The next prime is 10322101331. The reversal of 10322101313 is 31310122301.
Together with next prime (10322101331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10089599809 + 232501504 = 100447^2 + 15248^2 .
It is a cyclic number.
It is not a de Polignac number, because 10322101313 - 24 = 10322101297 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10322101291 and 10322101300.
It is not a weakly prime, because it can be changed into another prime (10322101303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5161050656 + 5161050657.
It is an arithmetic number, because the mean of its divisors is an integer number (5161050657).
Almost surely, 210322101313 is an apocalyptic number.
It is an amenable number.
10322101313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10322101313 is an equidigital number, since it uses as much as digits as its factorization.
10322101313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10322101313 its reverse (31310122301), we get a palindrome (41632223614).
The spelling of 10322101313 in words is "ten billion, three hundred twenty-two million, one hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •