Base | Representation |
---|---|
bin | 10100010000111… |
… | …01011101001001 |
3 | 102211212101101111 |
4 | 22020131131021 |
5 | 322004134321 |
6 | 24511250321 |
7 | 4132614361 |
oct | 1210353511 |
9 | 384771344 |
10 | 169989961 |
11 | 87a55a79 |
12 | 48b199a1 |
13 | 292aa89b |
14 | 1880d9a1 |
15 | edcc5e1 |
hex | a21d749 |
169989961 has 8 divisors (see below), whose sum is σ = 171254664. Its totient is φ = 168729600.
The previous prime is 169989959. The next prime is 169989971.
169989961 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 9486400 + 160503561 = 3080^2 + 12669^2 .
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 169989961 - 21 = 169989959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 169989896 and 169989905.
It is not an unprimeable number, because it can be changed into a prime (169989931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130011 + ... + 131311.
It is an arithmetic number, because the mean of its divisors is an integer number (21406833).
Almost surely, 2169989961 is an apocalyptic number.
It is an amenable number.
169989961 is a deficient number, since it is larger than the sum of its proper divisors (1264703).
169989961 is a wasteful number, since it uses less digits than its factorization.
169989961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2171.
The product of its digits is 1889568, while the sum is 58.
The square root of 169989961 is about 13038.0198266455. The cubic root of 169989961 is about 553.9549210237.
The spelling of 169989961 in words is "one hundred sixty-nine million, nine hundred eighty-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •