Base | Representation |
---|---|
bin | 1010111110001100101011… |
… | …0101110000100111001101 |
3 | 1120201021102222210010010111 |
4 | 2233203022311300213031 |
5 | 3040122344320220144 |
6 | 41353550222040021 |
7 | 2353400006534002 |
oct | 257431265604715 |
9 | 46637388703114 |
10 | 12063671257549 |
11 | 39311a0a2000a |
12 | 142a02b119011 |
13 | 6967a3918c02 |
14 | 2d9c55c8d8a9 |
15 | 15dc0cb0d534 |
hex | af8cad709cd |
12063671257549 has 2 divisors, whose sum is σ = 12063671257550. Its totient is φ = 12063671257548.
The previous prime is 12063671257541. The next prime is 12063671257679. The reversal of 12063671257549 is 94575217636021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11909884144900 + 153787112649 = 3451070^2 + 392157^2 .
It is an emirp because it is prime and its reverse (94575217636021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12063671257549 - 23 = 12063671257541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12063671257493 and 12063671257502.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12063671257541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6031835628774 + 6031835628775.
It is an arithmetic number, because the mean of its divisors is an integer number (6031835628775).
Almost surely, 212063671257549 is an apocalyptic number.
It is an amenable number.
12063671257549 is a deficient number, since it is larger than the sum of its proper divisors (1).
12063671257549 is an equidigital number, since it uses as much as digits as its factorization.
12063671257549 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19051200, while the sum is 58.
The spelling of 12063671257549 in words is "twelve trillion, sixty-three billion, six hundred seventy-one million, two hundred fifty-seven thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •