Base | Representation |
---|---|
bin | 1011101010010001… |
… | …1110101010101001 |
3 | 22002010212211020102 |
4 | 2322210132222221 |
5 | 22402302444334 |
6 | 1234333235145 |
7 | 140365423526 |
oct | 27244365251 |
9 | 8063784212 |
10 | 3130124969 |
11 | 1366968244 |
12 | 734332ab5 |
13 | 3ab644b6a |
14 | 2199da14d |
15 | 134be967e |
hex | ba91eaa9 |
3130124969 has 2 divisors, whose sum is σ = 3130124970. Its totient is φ = 3130124968.
The previous prime is 3130124917. The next prime is 3130124971. The reversal of 3130124969 is 9694210313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3038214400 + 91910569 = 55120^2 + 9587^2 .
It is a cyclic number.
It is not a de Polignac number, because 3130124969 - 28 = 3130124713 is a prime.
It is a super-2 number, since 2×31301249692 = 19595364643114501922, which contains 22 as substring.
Together with 3130124971, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3130124369) 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, 1565062484 + 1565062485.
It is an arithmetic number, because the mean of its divisors is an integer number (1565062485).
Almost surely, 23130124969 is an apocalyptic number.
It is an amenable number.
3130124969 is a deficient number, since it is larger than the sum of its proper divisors (1).
3130124969 is an equidigital number, since it uses as much as digits as its factorization.
3130124969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 38.
The square root of 3130124969 is about 55947.5197752322. The cubic root of 3130124969 is about 1462.8076592769.
The spelling of 3130124969 in words is "three billion, one hundred thirty million, one hundred twenty-four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •