Base | Representation |
---|---|
bin | 1100100110111011001… |
… | …0001100011100000001 |
3 | 202201002201022112200012 |
4 | 3021232302030130001 |
5 | 12022102344013310 |
6 | 243301412034305 |
7 | 21435503156222 |
oct | 3115662143401 |
9 | 681081275605 |
10 | 216607016705 |
11 | 839540176a2 |
12 | 35b91302995 |
13 | 1756ca89991 |
14 | a6ab905249 |
15 | 597b3c1c05 |
hex | 326ec8c701 |
216607016705 has 8 divisors (see below), whose sum is σ = 260775094272. Its totient is φ = 172721163888.
The previous prime is 216607016693. The next prime is 216607016707. The reversal of 216607016705 is 507610706612.
216607016705 is digitally balanced in base 11, because in such base it contains all the possibile digits an equal number of times.
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 216607016705 - 230 = 215533274881 is a prime.
It is a Duffinian number.
216607016705 is strictly pandigital in base 11.
It is not an unprimeable number, because it can be changed into a prime (216607016707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70554497 + ... + 70557566.
It is an arithmetic number, because the mean of its divisors is an integer number (32596886784).
Almost surely, 2216607016705 is an apocalyptic number.
It is an amenable number.
216607016705 is a deficient number, since it is larger than the sum of its proper divisors (44168077567).
216607016705 is a wasteful number, since it uses less digits than its factorization.
216607016705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141112375.
The product of its (nonzero) digits is 105840, while the sum is 41.
The spelling of 216607016705 in words is "two hundred sixteen billion, six hundred seven million, sixteen thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •