Base | Representation |
---|---|
bin | 1011010111001100… |
… | …11010101011000011 |
3 | 120202010121021102012 |
4 | 11223212122223003 |
5 | 44443122401011 |
6 | 2445152243135 |
7 | 304111563014 |
oct | 55346325303 |
9 | 16663537365 |
10 | 6100200131 |
11 | 2650449713 |
12 | 1222b404ab |
13 | 762a7c69c |
14 | 41c25300b |
15 | 25a82ba8b |
hex | 16b99aac3 |
6100200131 has 2 divisors, whose sum is σ = 6100200132. Its totient is φ = 6100200130.
The previous prime is 6100200107. The next prime is 6100200133. The reversal of 6100200131 is 1310020016.
6100200131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6100200131 is a prime.
It is a super-2 number, since 2×61002001312 = 74424883276504834322, which contains 22 as substring.
Together with 6100200133, 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 (6100200133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3050100065 + 3050100066.
It is an arithmetic number, because the mean of its divisors is an integer number (3050100066).
Almost surely, 26100200131 is an apocalyptic number.
6100200131 is a deficient number, since it is larger than the sum of its proper divisors (1).
6100200131 is an equidigital number, since it uses as much as digits as its factorization.
6100200131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 6100200131 is about 78103.7779559990. Note that the first 3 decimals coincide. The cubic root of 6100200131 is about 1827.1801186879.
Adding to 6100200131 its reverse (1310020016), we get a palindrome (7410220147).
The spelling of 6100200131 in words is "six billion, one hundred million, two hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •