Base | Representation |
---|---|
bin | 11110110011010010110… |
… | …110011101010110110101 |
3 | 21111100110202212001122012 |
4 | 132303102312131112311 |
5 | 234134410304313023 |
6 | 4300214131414005 |
7 | 305631562023515 |
oct | 36632266352665 |
9 | 7440422761565 |
10 | 2116661401013 |
11 | 7467421a8095 |
12 | 2a2281754305 |
13 | 1247a5b73483 |
14 | 7463864d845 |
15 | 3a0d4d08978 |
hex | 1ecd2d9d5b5 |
2116661401013 has 8 divisors (see below), whose sum is σ = 2117196716832. Its totient is φ = 2116126167696.
The previous prime is 2116661400983. The next prime is 2116661401033. The reversal of 2116661401013 is 3101041666112.
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-2116661401013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2116661401033) 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, 114299831 + ... + 114318347.
It is an arithmetic number, because the mean of its divisors is an integer number (264649589604).
Almost surely, 22116661401013 is an apocalyptic number.
It is an amenable number.
2116661401013 is a deficient number, since it is larger than the sum of its proper divisors (535315819).
2116661401013 is a wasteful number, since it uses less digits than its factorization.
2116661401013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41251.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 2116661401013 in words is "two trillion, one hundred sixteen billion, six hundred sixty-one million, four hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •