Base | Representation |
---|---|
bin | 10010110111101000… |
… | …00110101110111001 |
3 | 222010222222120222122 |
4 | 21123310012232321 |
5 | 131221330222223 |
6 | 4353115531025 |
7 | 506016205361 |
oct | 113364065671 |
9 | 28128876878 |
10 | 10130320313 |
11 | 4329335653 |
12 | 1b68759a75 |
13 | c559b8999 |
14 | 6c15a79a1 |
15 | 3e45515c8 |
hex | 25bd06bb9 |
10130320313 has 2 divisors, whose sum is σ = 10130320314. Its totient is φ = 10130320312.
The previous prime is 10130320309. The next prime is 10130320327. The reversal of 10130320313 is 31302303101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9747217984 + 383102329 = 98728^2 + 19573^2 .
It is a cyclic number.
It is not a de Polignac number, because 10130320313 - 22 = 10130320309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10130320291 and 10130320300.
It is not a weakly prime, because it can be changed into another prime (10130320393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065160156 + 5065160157.
It is an arithmetic number, because the mean of its divisors is an integer number (5065160157).
Almost surely, 210130320313 is an apocalyptic number.
It is an amenable number.
10130320313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10130320313 is an equidigital number, since it uses as much as digits as its factorization.
10130320313 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 17.
Adding to 10130320313 its reverse (31302303101), we get a palindrome (41432623414).
The spelling of 10130320313 in words is "ten billion, one hundred thirty million, three hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •