Base | Representation |
---|---|
bin | 101101011011100110010… |
… | …111101010100000011101 |
3 | 102001110110022220110010002 |
4 | 231123212113222200131 |
5 | 402122334333014442 |
6 | 10350122051224045 |
7 | 441362230341455 |
oct | 55334627524035 |
9 | 12043408813102 |
10 | 3122011219997 |
11 | aa4045a4118a |
12 | 4250972a8025 |
13 | 1985345bc577 |
14 | ab16b3b8d65 |
15 | 56326076732 |
hex | 2d6e65ea81d |
3122011219997 has 2 divisors, whose sum is σ = 3122011219998. Its totient is φ = 3122011219996.
The previous prime is 3122011219979. The next prime is 3122011220089. The reversal of 3122011219997 is 7999121102213.
Together with previous prime (3122011219979) 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., 3053875081156 + 68136138841 = 1747534^2 + 261029^2 .
It is a cyclic number.
It is not a de Polignac number, because 3122011219997 - 224 = 3121994442781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3122011219937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1561005609998 + 1561005609999.
It is an arithmetic number, because the mean of its divisors is an integer number (1561005609999).
Almost surely, 23122011219997 is an apocalyptic number.
It is an amenable number.
3122011219997 is a deficient number, since it is larger than the sum of its proper divisors (1).
3122011219997 is an equidigital number, since it uses as much as digits as its factorization.
3122011219997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 122472, while the sum is 47.
The spelling of 3122011219997 in words is "three trillion, one hundred twenty-two billion, eleven million, two hundred nineteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •