Base | Representation |
---|---|
bin | 110001010000111000000101… |
… | …011000011100000010101011 |
3 | 1001102010212200102022120001221 |
4 | 301100320011120130002223 |
5 | 211344310343142201121 |
6 | 2044450023343122511 |
7 | 63431313105451456 |
oct | 6120700530340253 |
9 | 1042125612276057 |
10 | 216664010506411 |
11 | 6304376656a186 |
12 | 20372b2a8a3437 |
13 | 93b84369c1490 |
14 | 3b7084616649d |
15 | 1a0addc688b41 |
hex | c50e0561c0ab |
216664010506411 has 8 divisors (see below), whose sum is σ = 233376594780560. Its totient is φ = 199958015079072.
The previous prime is 216664010506357. The next prime is 216664010506469. The reversal of 216664010506411 is 114605010466612.
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-216664010506411 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (216664010506511) 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, 1647143400 + ... + 1647274933.
It is an arithmetic number, because the mean of its divisors is an integer number (29172074347570).
Almost surely, 2216664010506411 is an apocalyptic number.
216664010506411 is a deficient number, since it is larger than the sum of its proper divisors (16712584274149).
216664010506411 is a wasteful number, since it uses less digits than its factorization.
216664010506411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3294423405.
The product of its (nonzero) digits is 207360, while the sum is 43.
The spelling of 216664010506411 in words is "two hundred sixteen trillion, six hundred sixty-four billion, ten million, five hundred six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •