Base | Representation |
---|---|
bin | 10011001101000101… |
… | …01011011010110001 |
3 | 222121112122120120101 |
4 | 21212202223122301 |
5 | 132103414120421 |
6 | 4423025312401 |
7 | 513333054433 |
oct | 114642533261 |
9 | 28545576511 |
10 | 10310301361 |
11 | 4410995018 |
12 | 1bb8a95701 |
13 | c84084049 |
14 | 6db458653 |
15 | 405254191 |
hex | 2668ab6b1 |
10310301361 has 2 divisors, whose sum is σ = 10310301362. Its totient is φ = 10310301360.
The previous prime is 10310301359. The next prime is 10310301373. The reversal of 10310301361 is 16310301301.
10310301361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5983950736 + 4326350625 = 77356^2 + 65775^2 .
It is a cyclic number.
It is not a de Polignac number, because 10310301361 - 21 = 10310301359 is a prime.
Together with 10310301359, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10310301301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5155150680 + 5155150681.
It is an arithmetic number, because the mean of its divisors is an integer number (5155150681).
Almost surely, 210310301361 is an apocalyptic number.
It is an amenable number.
10310301361 is a deficient number, since it is larger than the sum of its proper divisors (1).
10310301361 is an equidigital number, since it uses as much as digits as its factorization.
10310301361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 10310301361 its reverse (16310301301), we get a palindrome (26620602662).
The spelling of 10310301361 in words is "ten billion, three hundred ten million, three hundred one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •