Base | Representation |
---|---|
bin | 111111000101111… |
… | …1001111100000101 |
3 | 12110112121021210121 |
4 | 1332023321330011 |
5 | 13313431100432 |
6 | 550023421541 |
7 | 103314425530 |
oct | 17613717405 |
9 | 5415537717 |
10 | 2117050117 |
11 | 9970240a6 |
12 | 4b0bb48b1 |
13 | 2797aa6a0 |
14 | 161247a17 |
15 | c5cd4197 |
hex | 7e2f9f05 |
2117050117 has 8 divisors (see below), whose sum is σ = 2605600256. Its totient is φ = 1675028592.
The previous prime is 2117050063. The next prime is 2117050147. The reversal of 2117050117 is 7110507112.
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 2117050117 - 27 = 2117049989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2117050091 and 2117050100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2117050147) by changing a digit.
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, 11632053 + ... + 11632234.
It is an arithmetic number, because the mean of its divisors is an integer number (325700032).
Almost surely, 22117050117 is an apocalyptic number.
It is an amenable number.
2117050117 is a deficient number, since it is larger than the sum of its proper divisors (488550139).
2117050117 is a wasteful number, since it uses less digits than its factorization.
2117050117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23264307.
The product of its (nonzero) digits is 490, while the sum is 25.
The square root of 2117050117 is about 46011.4128994101. The cubic root of 2117050117 is about 1284.0355457482.
Adding to 2117050117 its reverse (7110507112), we get a palindrome (9227557229).
The spelling of 2117050117 in words is "two billion, one hundred seventeen million, fifty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •