Base | Representation |
---|---|
bin | 1011100010010101… |
… | …1011100111001001 |
3 | 21222211012202122022 |
4 | 2320211123213021 |
5 | 22320241221134 |
6 | 1231143334225 |
7 | 136512352142 |
oct | 27045334711 |
9 | 7884182568 |
10 | 3096820169 |
11 | 134a08a913 |
12 | 725151375 |
13 | 3a4783891 |
14 | 21540aac9 |
15 | 131d1b52e |
hex | b895b9c9 |
3096820169 has 2 divisors, whose sum is σ = 3096820170. Its totient is φ = 3096820168.
The previous prime is 3096820151. The next prime is 3096820171. The reversal of 3096820169 is 9610286903.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2938940944 + 157879225 = 54212^2 + 12565^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3096820169 is a prime.
It is a super-2 number, since 2×30968201692 = 19180590318250377122, which contains 22 as substring.
Together with 3096820171, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3096820189) 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 as a sum of consecutive naturals, namely, 1548410084 + 1548410085.
It is an arithmetic number, because the mean of its divisors is an integer number (1548410085).
Almost surely, 23096820169 is an apocalyptic number.
It is an amenable number.
3096820169 is a deficient number, since it is larger than the sum of its proper divisors (1).
3096820169 is an equidigital number, since it uses as much as digits as its factorization.
3096820169 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 square root of 3096820169 is about 55649.0805764120. The cubic root of 3096820169 is about 1457.6010157247.
The spelling of 3096820169 in words is "three billion, ninety-six million, eight hundred twenty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •