Base | Representation |
---|---|
bin | 1100110110100011… |
… | …10101011100011011 |
3 | 122210212202222000112 |
4 | 12123101311130123 |
5 | 103112412024011 |
6 | 3100405154535 |
7 | 332663656034 |
oct | 63321653433 |
9 | 18725688015 |
10 | 6900111131 |
11 | 2a20a29691 |
12 | 14069bba4b |
13 | 85c700bc4 |
14 | 496597a8b |
15 | 2a5b8758b |
hex | 19b47571b |
6900111131 has 2 divisors, whose sum is σ = 6900111132. Its totient is φ = 6900111130.
The previous prime is 6900111109. The next prime is 6900111133. The reversal of 6900111131 is 1311110096.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6900111131 is a prime.
It is a super-2 number, since 2×69001111312 = 95223067240300198322, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 6900111133, 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 = 6900111097 and 6900111106.
It is not a weakly prime, because it can be changed into another prime (6900111133) 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, 3450055565 + 3450055566.
It is an arithmetic number, because the mean of its divisors is an integer number (3450055566).
Almost surely, 26900111131 is an apocalyptic number.
6900111131 is a deficient number, since it is larger than the sum of its proper divisors (1).
6900111131 is an equidigital number, since it uses as much as digits as its factorization.
6900111131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 23.
The square root of 6900111131 is about 83066.9075564993. The cubic root of 6900111131 is about 1903.7884826225.
The spelling of 6900111131 in words is "six billion, nine hundred million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •