Base | Representation |
---|---|
bin | 1111001001111011010011… |
… | …0000000100110000011101 |
3 | 2011222222122210121012102210 |
4 | 3302132310300010300131 |
5 | 4141002223411024321 |
6 | 55234550121511033 |
7 | 3336606615325035 |
oct | 362366460046035 |
9 | 64888583535383 |
10 | 16663210642461 |
11 | 5344911aa9249 |
12 | 1a51537642479 |
13 | 93b445ac9626 |
14 | 41870a2108c5 |
15 | 1dd6ad29cb76 |
hex | f27b4c04c1d |
16663210642461 has 8 divisors (see below), whose sum is σ = 22217633688384. Its totient is φ = 11108797345760.
The previous prime is 16663210642459. The next prime is 16663210642513. The reversal of 16663210642461 is 16424601236661.
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 16663210642461 - 21 = 16663210642459 is a prime.
It is a super-2 number, since 2×166632106424612 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16663210642461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16663210642411) 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, 3918616 + ... + 6977246.
It is an arithmetic number, because the mean of its divisors is an integer number (2777204211048).
Almost surely, 216663210642461 is an apocalyptic number.
It is an amenable number.
16663210642461 is a deficient number, since it is larger than the sum of its proper divisors (5554423045923).
16663210642461 is a wasteful number, since it uses less digits than its factorization.
16663210642461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4874611.
The product of its (nonzero) digits is 1492992, while the sum is 48.
The spelling of 16663210642461 in words is "sixteen trillion, six hundred sixty-three billion, two hundred ten million, six hundred forty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •