Base | Representation |
---|---|
bin | 1011101010010100… |
… | …1010101011101111 |
3 | 22002011012222112222 |
4 | 2322211022223233 |
5 | 22402324232023 |
6 | 1234341145555 |
7 | 140400104261 |
oct | 27245125357 |
9 | 8064188488 |
10 | 3130305263 |
11 | 1366a80748 |
12 | 7343bb2bb |
13 | 3ab6a8c47 |
14 | 219a45b31 |
15 | 134c32cc8 |
hex | ba94aaef |
3130305263 has 2 divisors, whose sum is σ = 3130305264. Its totient is φ = 3130305262.
The previous prime is 3130305247. The next prime is 3130305287. The reversal of 3130305263 is 3625030313.
It is a weak prime.
It is an emirp because it is prime and its reverse (3625030313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3130305263 - 24 = 3130305247 is a prime.
It is a super-2 number, since 2×31303052632 = 19597622079130998338, which contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3130304263) 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, 1565152631 + 1565152632.
It is an arithmetic number, because the mean of its divisors is an integer number (1565152632).
Almost surely, 23130305263 is an apocalyptic number.
3130305263 is a deficient number, since it is larger than the sum of its proper divisors (1).
3130305263 is an equidigital number, since it uses as much as digits as its factorization.
3130305263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 26.
The square root of 3130305263 is about 55949.1310298918. The cubic root of 3130305263 is about 1462.8357444580.
Adding to 3130305263 its reverse (3625030313), we get a palindrome (6755335576).
The spelling of 3130305263 in words is "three billion, one hundred thirty million, three hundred five thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •