Base | Representation |
---|---|
bin | 1011001111001010… |
… | …1110101111100001 |
3 | 21210012221000210011 |
4 | 2303302232233201 |
5 | 22134200422241 |
6 | 1215152204521 |
7 | 134515102225 |
oct | 26362565741 |
9 | 7705830704 |
10 | 3016420321 |
11 | 1308766262 |
12 | 702239741 |
13 | 390c134c5 |
14 | 20887c785 |
15 | 129c39281 |
hex | b3caebe1 |
3016420321 has 2 divisors, whose sum is σ = 3016420322. Its totient is φ = 3016420320.
The previous prime is 3016420291. The next prime is 3016420327. The reversal of 3016420321 is 1230246103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2076078096 + 940342225 = 45564^2 + 30665^2 .
It is a cyclic number.
It is not a de Polignac number, because 3016420321 - 27 = 3016420193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3016420292 and 3016420301.
It is not a weakly prime, because it can be changed into another prime (3016420327) 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 as a sum of consecutive naturals, namely, 1508210160 + 1508210161.
It is an arithmetic number, because the mean of its divisors is an integer number (1508210161).
Almost surely, 23016420321 is an apocalyptic number.
It is an amenable number.
3016420321 is a deficient number, since it is larger than the sum of its proper divisors (1).
3016420321 is an equidigital number, since it uses as much as digits as its factorization.
3016420321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 3016420321 is about 54921.9475346605. The cubic root of 3016420321 is about 1444.8761396530.
Adding to 3016420321 its reverse (1230246103), we get a palindrome (4246666424).
The spelling of 3016420321 in words is "three billion, sixteen million, four hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •