Base | Representation |
---|---|
bin | 1011100011110100… |
… | …0010110100110101 |
3 | 22000020212020122001 |
4 | 2320331002310311 |
5 | 22323332310401 |
6 | 1231524135301 |
7 | 136616102452 |
oct | 27075026465 |
9 | 8006766561 |
10 | 3103010101 |
11 | 1352628464 |
12 | 727237531 |
13 | 3a5b40169 |
14 | 21617c829 |
15 | 132640601 |
hex | b8f42d35 |
3103010101 has 8 divisors (see below), whose sum is σ = 3110897664. Its totient is φ = 3095132880.
The previous prime is 3103010089. The next prime is 3103010107. The reversal of 3103010101 is 1010103013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3103010101 - 217 = 3102879029 is a prime.
It is a Duffinian number.
3103010101 is a modest number, since divided by 10101 gives 3103 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3103010107) 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 in 7 ways as a sum of consecutive naturals, for example, 1196316 + ... + 1198906.
It is an arithmetic number, because the mean of its divisors is an integer number (388862208).
Almost surely, 23103010101 is an apocalyptic number.
It is an amenable number.
3103010101 is a deficient number, since it is larger than the sum of its proper divisors (7887563).
3103010101 is a wasteful number, since it uses less digits than its factorization.
3103010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5171.
The product of its (nonzero) digits is 9, while the sum is 10.
The square root of 3103010101 is about 55704.6685745459. The cubic root of 3103010101 is about 1458.5715215962.
Adding to 3103010101 its reverse (1010103013), we get a palindrome (4113113114).
The spelling of 3103010101 in words is "three billion, one hundred three million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •