Base | Representation |
---|---|
bin | 111110100101011… |
… | …1010000001011101 |
3 | 12102100112121122221 |
4 | 1331022322001131 |
5 | 13300100323401 |
6 | 544214305341 |
7 | 103016541226 |
oct | 17512720135 |
9 | 5370477587 |
10 | 2100011101 |
11 | 988446471 |
12 | 4a7358251 |
13 | 2760c2c26 |
14 | 15cc9024d |
15 | c456a7a1 |
hex | 7d2ba05d |
2100011101 has 4 divisors (see below), whose sum is σ = 2126593600. Its totient is φ = 2073428604.
The previous prime is 2100011093. The next prime is 2100011117. The reversal of 2100011101 is 1011100012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2100011101 - 23 = 2100011093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100011141) 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 3 ways as a sum of consecutive naturals, for example, 13291131 + ... + 13291288.
It is an arithmetic number, because the mean of its divisors is an integer number (531648400).
Almost surely, 22100011101 is an apocalyptic number.
It is an amenable number.
2100011101 is a deficient number, since it is larger than the sum of its proper divisors (26582499).
2100011101 is an equidigital number, since it uses as much as digits as its factorization.
2100011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26582498.
The product of its (nonzero) digits is 2, while the sum is 7.
The square root of 2100011101 is about 45825.8780712383. The cubic root of 2100011101 is about 1280.5814214453.
Adding to 2100011101 its reverse (1011100012), we get a palindrome (3111111113).
The spelling of 2100011101 in words is "two billion, one hundred million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •