Base | Representation |
---|---|
bin | 1001011011001100… |
… | …1011110111000001 |
3 | 20112022122022222121 |
4 | 2112303023313001 |
5 | 20140140002241 |
6 | 1055014404241 |
7 | 116460435142 |
oct | 22663136701 |
9 | 6468568877 |
10 | 2530000321 |
11 | 1089134762 |
12 | 5a7360681 |
13 | 314204614 |
14 | 1a001dac9 |
15 | ec1a4ad1 |
hex | 96ccbdc1 |
2530000321 has 2 divisors, whose sum is σ = 2530000322. Its totient is φ = 2530000320.
The previous prime is 2530000301. The next prime is 2530000327. The reversal of 2530000321 is 1230000352.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1343955600 + 1186044721 = 36660^2 + 34439^2 .
It is a cyclic number.
It is not a de Polignac number, because 2530000321 - 223 = 2521611713 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2530000295 and 2530000304.
It is not a weakly prime, because it can be changed into another prime (2530000327) 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, 1265000160 + 1265000161.
It is an arithmetic number, because the mean of its divisors is an integer number (1265000161).
Almost surely, 22530000321 is an apocalyptic number.
It is an amenable number.
2530000321 is a deficient number, since it is larger than the sum of its proper divisors (1).
2530000321 is an equidigital number, since it uses as much as digits as its factorization.
2530000321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 2530000321 is about 50299.1085507487. The cubic root of 2530000321 is about 1362.6161294390.
Adding to 2530000321 its reverse (1230000352), we get a palindrome (3760000673).
The spelling of 2530000321 in words is "two billion, five hundred thirty million, three hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •