Base | Representation |
---|---|
bin | 1011011001000111000010… |
… | …0010001001001000111101 |
3 | 1122100110211100122112002022 |
4 | 2312101300202021020331 |
5 | 3120211233213234121 |
6 | 42350212030205525 |
7 | 2431655161433102 |
oct | 266216042111075 |
9 | 48313740575068 |
10 | 12526012633661 |
11 | 3a9a285640a4a |
12 | 14a37603538a5 |
13 | 6cb275ab5587 |
14 | 314395864aa9 |
15 | 16ac6c5a0aab |
hex | b647088923d |
12526012633661 has 2 divisors, whose sum is σ = 12526012633662. Its totient is φ = 12526012633660.
The previous prime is 12526012633627. The next prime is 12526012633663. The reversal of 12526012633661 is 16633621062521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12414594199225 + 111418434436 = 3523435^2 + 333794^2 .
It is a cyclic number.
It is not a de Polignac number, because 12526012633661 - 214 = 12526012617277 is a prime.
Together with 12526012633663, 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 (12526012633663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6263006316830 + 6263006316831.
It is an arithmetic number, because the mean of its divisors is an integer number (6263006316831).
Almost surely, 212526012633661 is an apocalyptic number.
It is an amenable number.
12526012633661 is a deficient number, since it is larger than the sum of its proper divisors (1).
12526012633661 is an equidigital number, since it uses as much as digits as its factorization.
12526012633661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 466560, while the sum is 44.
The spelling of 12526012633661 in words is "twelve trillion, five hundred twenty-six billion, twelve million, six hundred thirty-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •