Base | Representation |
---|---|
bin | 101011111101100010001… |
… | …111000011000110000101 |
3 | 101200210202101112000100012 |
4 | 223331202033003012011 |
5 | 343444012042333333 |
6 | 10231455523200005 |
7 | 431155306224326 |
oct | 53754217030605 |
9 | 11623671460305 |
10 | 3021010121093 |
11 | a65226501718 |
12 | 4095aa216005 |
13 | 18bb59579713 |
14 | a630940244d |
15 | 538b3edee48 |
hex | 2bf623c3185 |
3021010121093 has 2 divisors, whose sum is σ = 3021010121094. Its totient is φ = 3021010121092.
The previous prime is 3021010121081. The next prime is 3021010121099. The reversal of 3021010121093 is 3901210101203.
3021010121093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2826107296609 + 194902824484 = 1681103^2 + 441478^2 .
It is a cyclic number.
It is not a de Polignac number, because 3021010121093 - 218 = 3021009858949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3021010121099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510505060546 + 1510505060547.
It is an arithmetic number, because the mean of its divisors is an integer number (1510505060547).
Almost surely, 23021010121093 is an apocalyptic number.
It is an amenable number.
3021010121093 is a deficient number, since it is larger than the sum of its proper divisors (1).
3021010121093 is an equidigital number, since it uses as much as digits as its factorization.
3021010121093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 3021010121093 its reverse (3901210101203), we get a palindrome (6922220222296).
The spelling of 3021010121093 in words is "three trillion, twenty-one billion, ten million, one hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •