Base | Representation |
---|---|
bin | 1011010010011101… |
… | …0011111100001001 |
3 | 21211011212022200001 |
4 | 2310213103330021 |
5 | 22201213013134 |
6 | 1220403443001 |
7 | 135043211326 |
oct | 26447237411 |
9 | 7734768601 |
10 | 3030204169 |
11 | 1315520273 |
12 | 706986461 |
13 | 393a2b425 |
14 | 20a629b4d |
15 | 12b05d414 |
hex | b49d3f09 |
3030204169 has 2 divisors, whose sum is σ = 3030204170. Its totient is φ = 3030204168.
The previous prime is 3030204167. The next prime is 3030204173. The reversal of 3030204169 is 9614020303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2741883769 + 288320400 = 52363^2 + 16980^2 .
It is a cyclic number.
It is not a de Polignac number, because 3030204169 - 21 = 3030204167 is a prime.
It is a super-3 number, since 3×30302041693 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 3030204167, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3030204167) 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, 1515102084 + 1515102085.
It is an arithmetic number, because the mean of its divisors is an integer number (1515102085).
Almost surely, 23030204169 is an apocalyptic number.
It is an amenable number.
3030204169 is a deficient number, since it is larger than the sum of its proper divisors (1).
3030204169 is an equidigital number, since it uses as much as digits as its factorization.
3030204169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 3030204169 is about 55047.2902966168. The cubic root of 3030204169 is about 1447.0736333421.
The spelling of 3030204169 in words is "three billion, thirty million, two hundred four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •