Base | Representation |
---|---|
bin | 101101011001101111110… |
… | …000110011110111111101 |
3 | 102001021022122120012221222 |
4 | 231121233300303313331 |
5 | 402104300424321021 |
6 | 10345152405003125 |
7 | 441262015446323 |
oct | 55315760636775 |
9 | 12037278505858 |
10 | 3120021323261 |
11 | aa3214775327 |
12 | 4248209b34a5 |
13 | 1982a8271a8b |
14 | ab01cdcdd13 |
15 | 5625b50c6ab |
hex | 2d66fc33dfd |
3120021323261 has 2 divisors, whose sum is σ = 3120021323262. Its totient is φ = 3120021323260.
The previous prime is 3120021323239. The next prime is 3120021323281. The reversal of 3120021323261 is 1623231200213.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3101582399161 + 18438924100 = 1761131^2 + 135790^2 .
It is a cyclic number.
It is not a de Polignac number, because 3120021323261 - 26 = 3120021323197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3120021323261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3120021323281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560010661630 + 1560010661631.
It is an arithmetic number, because the mean of its divisors is an integer number (1560010661631).
Almost surely, 23120021323261 is an apocalyptic number.
It is an amenable number.
3120021323261 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120021323261 is an equidigital number, since it uses as much as digits as its factorization.
3120021323261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 3120021323261 its reverse (1623231200213), we get a palindrome (4743252523474).
The spelling of 3120021323261 in words is "three trillion, one hundred twenty billion, twenty-one million, three hundred twenty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •