Base | Representation |
---|---|
bin | 101101011010110010000… |
… | …011001111111100000001 |
3 | 102001101012011020021020102 |
4 | 231122302003033330001 |
5 | 402114040130444212 |
6 | 10345455013452145 |
7 | 441331411422254 |
oct | 55326203177401 |
9 | 12041164207212 |
10 | 3121133453057 |
11 | aa3735514964 |
12 | 424a91341055 |
13 | 1984247ab849 |
14 | ab0c69a909b |
15 | 562c3e8c5c2 |
hex | 2d6b20cff01 |
3121133453057 has 2 divisors, whose sum is σ = 3121133453058. Its totient is φ = 3121133453056.
The previous prime is 3121133452991. The next prime is 3121133453101. The reversal of 3121133453057 is 7503543311213.
3121133453057 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., 3113333207296 + 7800245761 = 1764464^2 + 88319^2 .
It is a cyclic number.
It is not a de Polignac number, because 3121133453057 - 210 = 3121133452033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3121133453057.
It is not a weakly prime, because it can be changed into another prime (3121133453657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560566726528 + 1560566726529.
It is an arithmetic number, because the mean of its divisors is an integer number (1560566726529).
Almost surely, 23121133453057 is an apocalyptic number.
It is an amenable number.
3121133453057 is a deficient number, since it is larger than the sum of its proper divisors (1).
3121133453057 is an equidigital number, since it uses as much as digits as its factorization.
3121133453057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 38.
The spelling of 3121133453057 in words is "three trillion, one hundred twenty-one billion, one hundred thirty-three million, four hundred fifty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •