Base | Representation |
---|---|
bin | 1010111110000010111110… |
… | …0010011010001001010101 |
3 | 1120201000201101222220111002 |
4 | 2233200233202122021111 |
5 | 3040102030310410214 |
6 | 41352435504153045 |
7 | 2353245311023601 |
oct | 257405742321125 |
9 | 46630641886432 |
10 | 12061065716309 |
11 | 3930084190345 |
12 | 1429622608785 |
13 | 696479b85a2c |
14 | 2d9a89c08501 |
15 | 15db08ed61de |
hex | af82f89a255 |
12061065716309 has 2 divisors, whose sum is σ = 12061065716310. Its totient is φ = 12061065716308.
The previous prime is 12061065716239. The next prime is 12061065716311. The reversal of 12061065716309 is 90361756016021.
12061065716309 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., 11859551812900 + 201513903409 = 3443770^2 + 448903^2 .
It is a cyclic number.
It is not a de Polignac number, because 12061065716309 - 220 = 12061064667733 is a prime.
Together with 12061065716311, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12061065016309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6030532858154 + 6030532858155.
It is an arithmetic number, because the mean of its divisors is an integer number (6030532858155).
Almost surely, 212061065716309 is an apocalyptic number.
It is an amenable number.
12061065716309 is a deficient number, since it is larger than the sum of its proper divisors (1).
12061065716309 is an equidigital number, since it uses as much as digits as its factorization.
12061065716309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 408240, while the sum is 47.
The spelling of 12061065716309 in words is "twelve trillion, sixty-one billion, sixty-five million, seven hundred sixteen thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •