Base | Representation |
---|---|
bin | 1011010010011011… |
… | …1011011101111011 |
3 | 21211011200020011112 |
4 | 2310212323131323 |
5 | 22201201311211 |
6 | 1220401350535 |
7 | 135042313151 |
oct | 26446733573 |
9 | 7734606145 |
10 | 3030103931 |
11 | 1315461a28 |
12 | 70693844b |
13 | 3939c490a |
14 | 20a6013d1 |
15 | 12b03d88b |
hex | b49bb77b |
3030103931 has 2 divisors, whose sum is σ = 3030103932. Its totient is φ = 3030103930.
The previous prime is 3030103913. The next prime is 3030103933. The reversal of 3030103931 is 1393010303.
Together with previous prime (3030103913) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3030103931 is a prime.
It is a super-2 number, since 2×30301039312 = 18363059665323305522, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 3030103933, 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 = 3030103897 and 3030103906.
It is not a weakly prime, because it can be changed into another prime (3030103933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515051965 + 1515051966.
It is an arithmetic number, because the mean of its divisors is an integer number (1515051966).
Almost surely, 23030103931 is an apocalyptic number.
3030103931 is a deficient number, since it is larger than the sum of its proper divisors (1).
3030103931 is an equidigital number, since it uses as much as digits as its factorization.
3030103931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 23.
The square root of 3030103931 is about 55046.3798173867. The cubic root of 3030103931 is about 1447.0576769513.
The spelling of 3030103931 in words is "three billion, thirty million, one hundred three thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •