Base | Representation |
---|---|
bin | 1001011101011010011… |
… | …00011101110000001001 |
3 | 1011001221210001001001011 |
4 | 10232231030131300021 |
5 | 20311124214220121 |
6 | 405152123523521 |
7 | 32324334510634 |
oct | 4565514356011 |
9 | 1131853031034 |
10 | 325028273161 |
11 | 115930a94379 |
12 | 52bab3895a1 |
13 | 2485b1840b7 |
14 | 11a35168c1b |
15 | 86c4ab87e1 |
hex | 4bad31dc09 |
325028273161 has 4 divisors (see below), whose sum is σ = 342135024400. Its totient is φ = 307921521924.
The previous prime is 325028273069. The next prime is 325028273177. The reversal of 325028273161 is 161372820523.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 161372820523 = 179 ⋅901524137.
It is a cyclic number.
It is not a de Polignac number, because 325028273161 - 27 = 325028273033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (325028273561) 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 in 3 ways as a sum of consecutive naturals, for example, 8553375591 + ... + 8553375628.
It is an arithmetic number, because the mean of its divisors is an integer number (85533756100).
Almost surely, 2325028273161 is an apocalyptic number.
It is an amenable number.
325028273161 is a deficient number, since it is larger than the sum of its proper divisors (17106751239).
325028273161 is a wasteful number, since it uses less digits than its factorization.
325028273161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17106751238.
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 325028273161 in words is "three hundred twenty-five billion, twenty-eight million, two hundred seventy-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •