Base | Representation |
---|---|
bin | 101101011010000001110… |
… | …000000111101100101111 |
3 | 102001022002200110201000002 |
4 | 231122001300013230233 |
5 | 402110410210212312 |
6 | 10345242345454515 |
7 | 441302342001641 |
oct | 55320160075457 |
9 | 12038080421002 |
10 | 3120323132207 |
11 | aa335a074906 |
12 | 4248a5aa143b |
13 | 198325954058 |
14 | ab04b114891 |
15 | 56277c774c2 |
hex | 2d681c07b2f |
3120323132207 has 2 divisors, whose sum is σ = 3120323132208. Its totient is φ = 3120323132206.
The previous prime is 3120323132081. The next prime is 3120323132221. The reversal of 3120323132207 is 7022313230213.
It is a happy number.
3120323132207 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 is a cyclic number.
It is not a de Polignac number, because 3120323132207 - 210 = 3120323131183 is a prime.
It is a super-2 number, since 2×31203231322072 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3120323132207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3120323102207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560161566103 + 1560161566104.
It is an arithmetic number, because the mean of its divisors is an integer number (1560161566104).
Almost surely, 23120323132207 is an apocalyptic number.
3120323132207 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120323132207 is an equidigital number, since it uses as much as digits as its factorization.
3120323132207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 29.
The spelling of 3120323132207 in words is "three trillion, one hundred twenty billion, three hundred twenty-three million, one hundred thirty-two thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •