Base | Representation |
---|---|
bin | 111110100111100… |
… | …1001001111010101 |
3 | 12102102122001112112 |
4 | 1331033021033111 |
5 | 13300341401010 |
6 | 544254200405 |
7 | 103032146063 |
oct | 17517111725 |
9 | 5372561475 |
10 | 2101122005 |
11 | 989035074 |
12 | 4a77b3105 |
13 | 2763c1778 |
14 | 15d09d033 |
15 | c46d9a05 |
hex | 7d3c93d5 |
2101122005 has 8 divisors (see below), whose sum is σ = 2521851192. Its totient is φ = 1680561088.
The previous prime is 2101121959. The next prime is 2101122017. The reversal of 2101122005 is 5002211012.
It can be written as a sum of positive squares in 4 ways, for example, as 1208188081 + 892933924 = 34759^2 + 29882^2 .
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 2101122005 - 210 = 2101120981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 12734 + ... + 66063.
It is an arithmetic number, because the mean of its divisors is an integer number (315231399).
Almost surely, 22101122005 is an apocalyptic number.
It is an amenable number.
2101122005 is a deficient number, since it is larger than the sum of its proper divisors (420729187).
2101122005 is an equidigital number, since it uses as much as digits as its factorization.
2101122005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84135.
The product of its (nonzero) digits is 40, while the sum is 14.
The square root of 2101122005 is about 45837.9973929926. The cubic root of 2101122005 is about 1280.8071904495.
Adding to 2101122005 its reverse (5002211012), we get a palindrome (7103333017).
The spelling of 2101122005 in words is "two billion, one hundred one million, one hundred twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •