Base | Representation |
---|---|
bin | 11111100110110011… |
… | …01001000000110001 |
3 | 1121210120012110011001 |
4 | 33303121221000301 |
5 | 234222413040321 |
6 | 11443433322001 |
7 | 1140331521316 |
oct | 176331510061 |
9 | 47716173131 |
10 | 16968486961 |
11 | 72182a5448 |
12 | 3356866301 |
13 | 17a560b83a |
14 | b6d838d0d |
15 | 694a4ec91 |
hex | 3f3669031 |
16968486961 has 8 divisors (see below), whose sum is σ = 17084936160. Its totient is φ = 16852188672.
The previous prime is 16968486949. The next prime is 16968486979.
16968486961 is nontrivially palindromic in base 10.
16968486961 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 16968486961 - 25 = 16968486929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16968486893 and 16968486902.
It is not an unprimeable number, because it can be changed into a prime (16968486901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192726 + ... + 266608.
It is an arithmetic number, because the mean of its divisors is an integer number (2135617020).
Almost surely, 216968486961 is an apocalyptic number.
It is an amenable number.
16968486961 is a deficient number, since it is larger than the sum of its proper divisors (116449199).
16968486961 is a wasteful number, since it uses less digits than its factorization.
16968486961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75455.
The product of its digits is 26873856, while the sum is 64.
The spelling of 16968486961 in words is "sixteen billion, nine hundred sixty-eight million, four hundred eighty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •