Base | Representation |
---|---|
bin | 1011010000000110… |
… | …0100101100011001 |
3 | 21210111020201020021 |
4 | 2310001210230121 |
5 | 22141144430241 |
6 | 1215411430441 |
7 | 134563136236 |
oct | 26401445431 |
9 | 7714221207 |
10 | 3020311321 |
11 | 130a983665 |
12 | 7035b5421 |
13 | 391976581 |
14 | 2091b278d |
15 | 12a2570d1 |
hex | b4064b19 |
3020311321 has 8 divisors (see below), whose sum is σ = 3085459200. Its totient is φ = 2955200448.
The previous prime is 3020311313. The next prime is 3020311367. The reversal of 3020311321 is 1231130203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3020311321 - 23 = 3020311313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3020311295 and 3020311304.
It is not an unprimeable number, because it can be changed into a prime (3020311621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 211980 + ... + 225778.
It is an arithmetic number, because the mean of its divisors is an integer number (385682400).
Almost surely, 23020311321 is an apocalyptic number.
It is an amenable number.
3020311321 is a deficient number, since it is larger than the sum of its proper divisors (65147879).
3020311321 is a wasteful number, since it uses less digits than its factorization.
3020311321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18503.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 3020311321 is about 54957.3591159546. The cubic root of 3020311321 is about 1445.4971403580.
Adding to 3020311321 its reverse (1231130203), we get a palindrome (4251441524).
The spelling of 3020311321 in words is "three billion, twenty million, three hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •