Base | Representation |
---|---|
bin | 101011111100111001001… |
… | …111001110100101010101 |
3 | 101200201222110021012022211 |
4 | 223330321033032211111 |
5 | 343441110002133133 |
6 | 10231303352553421 |
7 | 431132254655602 |
oct | 53747117164525 |
9 | 11621873235284 |
10 | 3020322302293 |
11 | a64a0322222a |
12 | 4094379b2871 |
13 | 18ba79c1394a |
14 | a6281d196a9 |
15 | 53873926bcd |
hex | 2bf393ce955 |
3020322302293 has 2 divisors, whose sum is σ = 3020322302294. Its totient is φ = 3020322302292.
The previous prime is 3020322302273. The next prime is 3020322302329. The reversal of 3020322302293 is 3922032230203.
Together with next prime (3020322302329) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1524392723569 + 1495929578724 = 1234663^2 + 1223082^2 .
It is a cyclic number.
It is not a de Polignac number, because 3020322302293 - 217 = 3020322171221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3020322302213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510161151146 + 1510161151147.
It is an arithmetic number, because the mean of its divisors is an integer number (1510161151147).
Almost surely, 23020322302293 is an apocalyptic number.
It is an amenable number.
3020322302293 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020322302293 is an equidigital number, since it uses as much as digits as its factorization.
3020322302293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 3020322302293 its reverse (3922032230203), we get a palindrome (6942354532496).
The spelling of 3020322302293 in words is "three trillion, twenty billion, three hundred twenty-two million, three hundred two thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •