Base | Representation |
---|---|
bin | 11110101010001110… |
… | …11101111010111101 |
3 | 1120111011011021201202 |
4 | 33111013131322331 |
5 | 232202331001321 |
6 | 11321203345245 |
7 | 1121622101132 |
oct | 172507357275 |
9 | 46434137652 |
10 | 16460406461 |
11 | 6a8751a004 |
12 | 3234682225 |
13 | 17242877a5 |
14 | b2217c589 |
15 | 66513c70b |
hex | 3d51ddebd |
16460406461 has 2 divisors, whose sum is σ = 16460406462. Its totient is φ = 16460406460.
The previous prime is 16460406449. The next prime is 16460406463.
16460406461 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9306460900 + 7153945561 = 96470^2 + 84581^2 .
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16460406461 is a prime.
It is a super-2 number, since 2×164604064612 (a number of 21 digits) contains 22 as substring.
Together with 16460406463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16460406463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8230203230 + 8230203231.
It is an arithmetic number, because the mean of its divisors is an integer number (8230203231).
Almost surely, 216460406461 is an apocalyptic number.
It is an amenable number.
16460406461 is a deficient number, since it is larger than the sum of its proper divisors (1).
16460406461 is an equidigital number, since it uses as much as digits as its factorization.
16460406461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 38.
The spelling of 16460406461 in words is "sixteen billion, four hundred sixty million, four hundred six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.400 sec. • engine limits •