Base | Representation |
---|---|
bin | 1011010110100010001001… |
… | …0100011001111100000001 |
3 | 1122012020120200002011222001 |
4 | 2311220202110121330001 |
5 | 3114000111142033031 |
6 | 42314012004144001 |
7 | 2425530263503414 |
oct | 265504224317401 |
9 | 48166520064861 |
10 | 12481750736641 |
11 | 3a8253198a66a |
12 | 1497069098001 |
13 | 6c7040a94a74 |
14 | 31219724bb7b |
15 | 169a2b85e861 |
hex | b5a22519f01 |
12481750736641 has 2 divisors, whose sum is σ = 12481750736642. Its totient is φ = 12481750736640.
The previous prime is 12481750736617. The next prime is 12481750736657. The reversal of 12481750736641 is 14663705718421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11368219279041 + 1113531457600 = 3371679^2 + 1055240^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12481750736641 is a prime.
It is a super-2 number, since 2×124817507366412 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12481750736671) 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, 6240875368320 + 6240875368321.
It is an arithmetic number, because the mean of its divisors is an integer number (6240875368321).
Almost surely, 212481750736641 is an apocalyptic number.
It is an amenable number.
12481750736641 is a deficient number, since it is larger than the sum of its proper divisors (1).
12481750736641 is an equidigital number, since it uses as much as digits as its factorization.
12481750736641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6773760, while the sum is 55.
The spelling of 12481750736641 in words is "twelve trillion, four hundred eighty-one billion, seven hundred fifty million, seven hundred thirty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •