Base | Representation |
---|---|
bin | 1001100011010000111… |
… | …00001001110110001001 |
3 | 1011101001201020100021011 |
4 | 10301220130021312021 |
5 | 20334042422202241 |
6 | 410431544043521 |
7 | 32465231432404 |
oct | 4615034116611 |
9 | 1141051210234 |
10 | 328169725321 |
11 | 1171a3288929 |
12 | 537274635a1 |
13 | 24c3bc63929 |
14 | 11c52472d3b |
15 | 880a79e281 |
hex | 4c68709d89 |
328169725321 has 9 divisors (see below), whose sum is σ = 343072107021. Its totient is φ = 313888873452.
The previous prime is 328169725319. The next prime is 328169725339. The reversal of 328169725321 is 123527961823.
The square root of 328169725321 is 572861.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 328169725321 - 21 = 328169725319 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (328169735321) 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 in 8 ways as a sum of consecutive naturals, for example, 13163350 + ... + 13188256.
Almost surely, 2328169725321 is an apocalyptic number.
328169725321 is the 572861-st square number.
328169725321 is the 286431-st centered octagonal number.
It is an amenable number.
328169725321 is a deficient number, since it is larger than the sum of its proper divisors (14902381700).
328169725321 is an frugal number, since it uses more digits than its factorization.
328169725321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49860 (or 24930 counting only the distinct ones).
The product of its digits is 1088640, while the sum is 49.
Multiplying 328169725321 by its sum of digits (49), we get a square (16080316540729 = 40100272).
The spelling of 328169725321 in words is "three hundred twenty-eight billion, one hundred sixty-nine million, seven hundred twenty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •