Base | Representation |
---|---|
bin | 11111100001010001… |
… | …11011001110010101 |
3 | 1121200100000220100022 |
4 | 33300220323032111 |
5 | 234124033141234 |
6 | 11435100354525 |
7 | 1136230001321 |
oct | 176050731625 |
9 | 47610026308 |
10 | 16922162069 |
11 | 71a413490a |
12 | 3343245a45 |
13 | 1798b3c167 |
14 | b6761a981 |
15 | 69094de2e |
hex | 3f0a3b395 |
16922162069 has 2 divisors, whose sum is σ = 16922162070. Its totient is φ = 16922162068.
The previous prime is 16922162039. The next prime is 16922162077. The reversal of 16922162069 is 96026122961.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15860379844 + 1061782225 = 125938^2 + 32585^2 .
It is an emirp because it is prime and its reverse (96026122961) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16922162069 is a prime.
It is a super-2 number, since 2×169221620692 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16922162009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8461081034 + 8461081035.
It is an arithmetic number, because the mean of its divisors is an integer number (8461081035).
Almost surely, 216922162069 is an apocalyptic number.
It is an amenable number.
16922162069 is a deficient number, since it is larger than the sum of its proper divisors (1).
16922162069 is an equidigital number, since it uses as much as digits as its factorization.
16922162069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 44.
The spelling of 16922162069 in words is "sixteen billion, nine hundred twenty-two million, one hundred sixty-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •