Base | Representation |
---|---|
bin | 11110110010110010010… |
… | …011001100000110001001 |
3 | 21111022001201020110102112 |
4 | 132302302103030012021 |
5 | 234132301003044421 |
6 | 4300044022312105 |
7 | 305612211064631 |
oct | 36626223140611 |
9 | 7438051213375 |
10 | 2116115284361 |
11 | 746491a02611 |
12 | 2a214a888635 |
13 | 124719992720 |
14 | 745c5cd16c1 |
15 | 3a0a1dd145b |
hex | 1ecb24cc189 |
2116115284361 has 8 divisors (see below), whose sum is σ = 2282279564040. Its totient is φ = 1950434744832.
The previous prime is 2116115284337. The next prime is 2116115284403. The reversal of 2116115284361 is 1634825116112.
It can be written as a sum of positive squares in 4 ways, for example, as 60691278736 + 2055424005625 = 246356^2 + 1433675^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2116115284361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2116115284301) 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, 120925946 + ... + 120943443.
It is an arithmetic number, because the mean of its divisors is an integer number (285284945505).
Almost surely, 22116115284361 is an apocalyptic number.
It is an amenable number.
2116115284361 is a deficient number, since it is larger than the sum of its proper divisors (166164279679).
2116115284361 is a wasteful number, since it uses less digits than its factorization.
2116115284361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241870075.
The product of its digits is 69120, while the sum is 41.
The spelling of 2116115284361 in words is "two trillion, one hundred sixteen billion, one hundred fifteen million, two hundred eighty-four thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •