Base | Representation |
---|---|
bin | 11110110010110001100… |
… | …010011000000111111001 |
3 | 21111022000211011100220022 |
4 | 132302301202120013321 |
5 | 234132234214113234 |
6 | 4300042444140225 |
7 | 305611664242256 |
oct | 36626142300771 |
9 | 7438024140808 |
10 | 2116102488569 |
11 | 746485762983 |
12 | 2a2146537675 |
13 | 124717132454 |
14 | 745c432042d |
15 | 3a0a0c04e2e |
hex | 1ecb18981f9 |
2116102488569 has 8 divisors (see below), whose sum is σ = 2184380610048. Its totient is φ = 2047825414080.
The previous prime is 2116102488557. The next prime is 2116102488571. The reversal of 2116102488569 is 9658842016112.
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 2116102488569 - 224 = 2116085711353 is a prime.
It is a super-2 number, since 2×21161024885692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2116102488569.
It is not an unprimeable number, because it can be changed into a prime (2116102488769) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7492529 + ... + 7769825.
It is an arithmetic number, because the mean of its divisors is an integer number (273047576256).
Almost surely, 22116102488569 is an apocalyptic number.
It is an amenable number.
2116102488569 is a deficient number, since it is larger than the sum of its proper divisors (68278121479).
2116102488569 is a wasteful number, since it uses less digits than its factorization.
2116102488569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523495.
The product of its (nonzero) digits is 1658880, while the sum is 53.
The spelling of 2116102488569 in words is "two trillion, one hundred sixteen billion, one hundred two million, four hundred eighty-eight thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •