Base | Representation |
---|---|
bin | 101011111100111001110… |
… | …100111111110100110001 |
3 | 101200202000010220012222021 |
4 | 223330321310333310301 |
5 | 343441120021001223 |
6 | 10231304345111441 |
7 | 431132435063545 |
oct | 53747164776461 |
9 | 11622003805867 |
10 | 3020332203313 |
11 | a64a08874a97 |
12 | 40943b188581 |
13 | 18ba7bc9c439 |
14 | a6283375a25 |
15 | 5387473065d |
hex | 2bf39d3fd31 |
3020332203313 has 2 divisors, whose sum is σ = 3020332203314. Its totient is φ = 3020332203312.
The previous prime is 3020332203311. The next prime is 3020332203379. The reversal of 3020332203313 is 3133022330203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1849904652544 + 1170427550769 = 1360112^2 + 1081863^2 .
It is a cyclic number.
It is not a de Polignac number, because 3020332203313 - 21 = 3020332203311 is a prime.
It is a super-2 number, since 2×30203322033132 (a number of 26 digits) contains 22 as substring.
Together with 3020332203311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3020332203311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510166101656 + 1510166101657.
It is an arithmetic number, because the mean of its divisors is an integer number (1510166101657).
Almost surely, 23020332203313 is an apocalyptic number.
It is an amenable number.
3020332203313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020332203313 is an equidigital number, since it uses as much as digits as its factorization.
3020332203313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 25.
Adding to 3020332203313 its reverse (3133022330203), we get a palindrome (6153354533516).
The spelling of 3020332203313 in words is "three trillion, twenty billion, three hundred thirty-two million, two hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •