Base | Representation |
---|---|
bin | 1011100111011010… |
… | …1101001001001001 |
3 | 22001022022012020212 |
4 | 2321312231021021 |
5 | 22341220010031 |
6 | 1233224130505 |
7 | 140161426211 |
oct | 27166551111 |
9 | 8038265225 |
10 | 3118125641 |
11 | 1360111a44 |
12 | 730306a35 |
13 | 3a9003277 |
14 | 218195241 |
15 | 133b2912b |
hex | b9dad249 |
3118125641 has 2 divisors, whose sum is σ = 3118125642. Its totient is φ = 3118125640.
The previous prime is 3118125623. The next prime is 3118125643. The reversal of 3118125641 is 1465218113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3047481616 + 70644025 = 55204^2 + 8405^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3118125641 is a prime.
Together with 3118125643, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 3118125598 and 3118125607.
It is not a weakly prime, because it can be changed into another prime (3118125643) 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, 1559062820 + 1559062821.
It is an arithmetic number, because the mean of its divisors is an integer number (1559062821).
Almost surely, 23118125641 is an apocalyptic number.
It is an amenable number.
3118125641 is a deficient number, since it is larger than the sum of its proper divisors (1).
3118125641 is an equidigital number, since it uses as much as digits as its factorization.
3118125641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5760, while the sum is 32.
The square root of 3118125641 is about 55840.1794499266. The cubic root of 3118125641 is about 1460.9360421801.
The spelling of 3118125641 in words is "three billion, one hundred eighteen million, one hundred twenty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •