Base | Representation |
---|---|
bin | 111110100111010… |
… | …1111011000101001 |
3 | 12102102102200021022 |
4 | 1331032233120221 |
5 | 13300330003410 |
6 | 544252022225 |
7 | 103031225246 |
oct | 17516573051 |
9 | 5372380238 |
10 | 2101016105 |
11 | 988a72551 |
12 | 4a7761975 |
13 | 2763854c6 |
14 | 15d0725cd |
15 | c46b8455 |
hex | 7d3af629 |
2101016105 has 8 divisors (see below), whose sum is σ = 2653915200. Its totient is φ = 1592348976.
The previous prime is 2101016081. The next prime is 2101016129. The reversal of 2101016105 is 5016101012.
It is an interprime number because it is at equal distance from previous prime (2101016081) and next prime (2101016129).
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 2101016105 - 214 = 2100999721 is a prime.
It is an alternating number because its digits alternate between even and odd.
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, 11057885 + ... + 11058074.
It is an arithmetic number, because the mean of its divisors is an integer number (331739400).
Almost surely, 22101016105 is an apocalyptic number.
It is an amenable number.
2101016105 is a deficient number, since it is larger than the sum of its proper divisors (552899095).
2101016105 is a wasteful number, since it uses less digits than its factorization.
2101016105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22115983.
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 2101016105 is about 45836.8422232597. The cubic root of 2101016105 is about 1280.7856718260.
Adding to 2101016105 its reverse (5016101012), we get a palindrome (7117117117).
The spelling of 2101016105 in words is "two billion, one hundred one million, sixteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •