Base | Representation |
---|---|
bin | 1011100110001100… |
… | …1100001110110101 |
3 | 22000221200022001102 |
4 | 2321203030032311 |
5 | 22333412310401 |
6 | 1232522335445 |
7 | 140100102125 |
oct | 27143141665 |
9 | 8027608042 |
10 | 3113010101 |
11 | 1358238623 |
12 | 72a65a585 |
13 | 3a7c31a16 |
14 | 217622c85 |
15 | 13346856b |
hex | b98cc3b5 |
3113010101 has 2 divisors, whose sum is σ = 3113010102. Its totient is φ = 3113010100.
The previous prime is 3113010083. The next prime is 3113010137. The reversal of 3113010101 is 1010103113.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2268235876 + 844774225 = 47626^2 + 29065^2 .
It is a cyclic number.
It is not a de Polignac number, because 3113010101 - 230 = 2039268277 is a prime.
3113010101 is a modest number, since divided by 10101 gives 3113 as remainder.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3113010401) 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, 1556505050 + 1556505051.
It is an arithmetic number, because the mean of its divisors is an integer number (1556505051).
Almost surely, 23113010101 is an apocalyptic number.
It is an amenable number.
3113010101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113010101 is an equidigital number, since it uses as much as digits as its factorization.
3113010101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 11.
The square root of 3113010101 is about 55794.3554582361. The cubic root of 3113010101 is about 1460.1366765461.
Adding to 3113010101 its reverse (1010103113), we get a palindrome (4123113214).
The spelling of 3113010101 in words is "three billion, one hundred thirteen million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •