Base | Representation |
---|---|
bin | 10100001001100… |
… | …11010100111001 |
3 | 102210001122220021 |
4 | 22010303110321 |
5 | 321232442334 |
6 | 24434530441 |
7 | 4121511442 |
oct | 1204632471 |
9 | 383048807 |
10 | 169030969 |
11 | 87460518 |
12 | 48736a21 |
13 | 29033233 |
14 | 186402c9 |
15 | ec8d3b4 |
hex | a133539 |
169030969 has 2 divisors, whose sum is σ = 169030970. Its totient is φ = 169030968.
The previous prime is 169030951. The next prime is 169030993. The reversal of 169030969 is 969030961.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 164352400 + 4678569 = 12820^2 + 2163^2 .
It is an emirp because it is prime and its reverse (969030961) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 169030969 - 221 = 166933817 is a prime.
It is a super-2 number, since 2×1690309692 = 57142936962157922, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is not a weakly prime, because it can be changed into another prime (169030909) 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 as a sum of consecutive naturals, namely, 84515484 + 84515485.
It is an arithmetic number, because the mean of its divisors is an integer number (84515485).
Almost surely, 2169030969 is an apocalyptic number.
It is an amenable number.
169030969 is a deficient number, since it is larger than the sum of its proper divisors (1).
169030969 is an equidigital number, since it uses as much as digits as its factorization.
169030969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78732, while the sum is 43.
The square root of 169030969 is about 13001.1910608221. The cubic root of 169030969 is about 552.9112506321.
The spelling of 169030969 in words is "one hundred sixty-nine million, thirty thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •