Base | Representation |
---|---|
bin | 1111001010111010111000… |
… | …0110101101100001100001 |
3 | 2012001121201022201212111201 |
4 | 3302232232012231201201 |
5 | 4141242202411132111 |
6 | 55250451524041201 |
7 | 3341052602113543 |
oct | 362565606554141 |
9 | 65047638655451 |
10 | 16680279005281 |
11 | 535108070a921 |
12 | 1a548bb833201 |
13 | 93cc360072b8 |
14 | 419489007693 |
15 | 1ddd5b97a6c1 |
hex | f2bae1ad861 |
16680279005281 has 2 divisors, whose sum is σ = 16680279005282. Its totient is φ = 16680279005280.
The previous prime is 16680279005153. The next prime is 16680279005297. The reversal of 16680279005281 is 18250097208661.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16675102922256 + 5176083025 = 4083516^2 + 71945^2 .
It is a cyclic number.
It is not a de Polignac number, because 16680279005281 - 27 = 16680279005153 is a prime.
It is a super-2 number, since 2×166802790052812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16680279005681) 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, 8340139502640 + 8340139502641.
It is an arithmetic number, because the mean of its divisors is an integer number (8340139502641).
Almost surely, 216680279005281 is an apocalyptic number.
It is an amenable number.
16680279005281 is a deficient number, since it is larger than the sum of its proper divisors (1).
16680279005281 is an equidigital number, since it uses as much as digits as its factorization.
16680279005281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 55.
The spelling of 16680279005281 in words is "sixteen trillion, six hundred eighty billion, two hundred seventy-nine million, five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •