Base | Representation |
---|---|
bin | 1011100011110101… |
… | …1011111101000111 |
3 | 22000021001110211021 |
4 | 2320331123331013 |
5 | 22323344104111 |
6 | 1231530252011 |
7 | 136620011524 |
oct | 27075337507 |
9 | 8007043737 |
10 | 3103113031 |
11 | 1352698827 |
12 | 727287007 |
13 | 3a5b77c75 |
14 | 2161a814b |
15 | 132660d71 |
hex | b8f5bf47 |
3103113031 has 2 divisors, whose sum is σ = 3103113032. Its totient is φ = 3103113030.
The previous prime is 3103113029. The next prime is 3103113049. The reversal of 3103113031 is 1303113013.
It is a weak prime.
It is an emirp because it is prime and its reverse (1303113013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3103113031 - 21 = 3103113029 is a prime.
It is a super-2 number, since 2×31031130312 = 19258620966324013922, which contains 22 as substring.
Together with 3103113029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 3103112996 and 3103113014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3103114031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1551556515 + 1551556516.
It is an arithmetic number, because the mean of its divisors is an integer number (1551556516).
Almost surely, 23103113031 is an apocalyptic number.
3103113031 is a deficient number, since it is larger than the sum of its proper divisors (1).
3103113031 is an equidigital number, since it uses as much as digits as its factorization.
3103113031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 16.
The square root of 3103113031 is about 55705.5924571313. The cubic root of 3103113031 is about 1458.5876488513.
Adding to 3103113031 its reverse (1303113013), we get a palindrome (4406226044).
The spelling of 3103113031 in words is "three billion, one hundred three million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •