Base | Representation |
---|---|
bin | 101101011001101110100… |
… | …111000110010101000101 |
3 | 102001021021022012111200221 |
4 | 231121232213012111011 |
5 | 402104231003001242 |
6 | 10345150434504341 |
7 | 441261362300005 |
oct | 55315647062505 |
9 | 12037238174627 |
10 | 3120002000197 |
11 | aa3204877655 |
12 | 4248164350b1 |
13 | 1982a4267804 |
14 | ab01a600005 |
15 | 56259992167 |
hex | 2d66e9c6545 |
3120002000197 has 2 divisors, whose sum is σ = 3120002000198. Its totient is φ = 3120002000196.
The previous prime is 3120002000183. The next prime is 3120002000221. The reversal of 3120002000197 is 7910002000213.
3120002000197 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2747060945476 + 372941054721 = 1657426^2 + 610689^2 .
It is a cyclic number.
It is not a de Polignac number, because 3120002000197 - 211 = 3120001998149 is a prime.
It is a super-3 number, since 3×31200020001973 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3120002000117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560001000098 + 1560001000099.
It is an arithmetic number, because the mean of its divisors is an integer number (1560001000099).
Almost surely, 23120002000197 is an apocalyptic number.
It is an amenable number.
3120002000197 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120002000197 is an equidigital number, since it uses as much as digits as its factorization.
3120002000197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 25.
The spelling of 3120002000197 in words is "three trillion, one hundred twenty billion, two million, one hundred ninety-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •