Base | Representation |
---|---|
bin | 1011101010010000… |
… | …0001100111111101 |
3 | 22002010122210001122 |
4 | 2322210001213331 |
5 | 22402240143023 |
6 | 1234330520325 |
7 | 140364416651 |
oct | 27244014775 |
9 | 8063583048 |
10 | 3130006013 |
11 | 1366896932 |
12 | 7342960a5 |
13 | 3ab602984 |
14 | 2199a8a61 |
15 | 134bc42c8 |
hex | ba9019fd |
3130006013 has 2 divisors, whose sum is σ = 3130006014. Its totient is φ = 3130006012.
The previous prime is 3130005973. The next prime is 3130006027. The reversal of 3130006013 is 3106000313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3115090969 + 14915044 = 55813^2 + 3862^2 .
It is a cyclic number.
It is not a de Polignac number, because 3130006013 - 220 = 3128957437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3130005982 and 3130006000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3130006073) 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, 1565003006 + 1565003007.
It is an arithmetic number, because the mean of its divisors is an integer number (1565003007).
Almost surely, 23130006013 is an apocalyptic number.
It is an amenable number.
3130006013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3130006013 is an equidigital number, since it uses as much as digits as its factorization.
3130006013 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.
The square root of 3130006013 is about 55946.4566617047. The cubic root of 3130006013 is about 1462.7891283924.
Adding to 3130006013 its reverse (3106000313), we get a palindrome (6236006326).
The spelling of 3130006013 in words is "three billion, one hundred thirty million, six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •