Base | Representation |
---|---|
bin | 11110101010111011… |
… | …01010011000010101 |
3 | 1120111120002212210122 |
4 | 33111131222120111 |
5 | 232210323142121 |
6 | 11321532201325 |
7 | 1122022412615 |
oct | 172535523025 |
9 | 46446085718 |
10 | 16466224661 |
11 | 6a8a833337 |
12 | 3236609245 |
13 | 1725543b03 |
14 | b22c54a45 |
15 | 6658db5ab |
hex | 3d576a615 |
16466224661 has 2 divisors, whose sum is σ = 16466224662. Its totient is φ = 16466224660.
The previous prime is 16466224613. The next prime is 16466224669. The reversal of 16466224661 is 16642266461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10240225636 + 6225999025 = 101194^2 + 78905^2 .
It is an emirp because it is prime and its reverse (16642266461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16466224661 - 226 = 16399115797 is a prime.
It is a super-2 number, since 2×164662246612 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16466224669) 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 as a sum of consecutive naturals, namely, 8233112330 + 8233112331.
It is an arithmetic number, because the mean of its divisors is an integer number (8233112331).
Almost surely, 216466224661 is an apocalyptic number.
It is an amenable number.
16466224661 is a deficient number, since it is larger than the sum of its proper divisors (1).
16466224661 is an equidigital number, since it uses as much as digits as its factorization.
16466224661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 497664, while the sum is 44.
The spelling of 16466224661 in words is "sixteen billion, four hundred sixty-six million, two hundred twenty-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •