Base | Representation |
---|---|
bin | 1011010101010010110110… |
… | …0100010100010001100001 |
3 | 1122010012122012111110020101 |
4 | 2311110231210110101201 |
5 | 3113123012420330031 |
6 | 42300131452542401 |
7 | 2424144633503242 |
oct | 265245544242141 |
9 | 48105565443211 |
10 | 12460464620641 |
11 | 3a744a9486664 |
12 | 1492b08481a01 |
13 | 6c502ab0385b |
14 | 31113821acc9 |
15 | 1691d2c47361 |
hex | b552d914461 |
12460464620641 has 2 divisors, whose sum is σ = 12460464620642. Its totient is φ = 12460464620640.
The previous prime is 12460464620603. The next prime is 12460464620671. The reversal of 12460464620641 is 14602646406421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9967097299041 + 2493367321600 = 3157071^2 + 1579040^2 .
It is a cyclic number.
It is not a de Polignac number, because 12460464620641 - 29 = 12460464620129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12460464620591 and 12460464620600.
It is not a weakly prime, because it can be changed into another prime (12460464620671) 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, 6230232310320 + 6230232310321.
It is an arithmetic number, because the mean of its divisors is an integer number (6230232310321).
Almost surely, 212460464620641 is an apocalyptic number.
It is an amenable number.
12460464620641 is a deficient number, since it is larger than the sum of its proper divisors (1).
12460464620641 is an equidigital number, since it uses as much as digits as its factorization.
12460464620641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1327104, while the sum is 46.
The spelling of 12460464620641 in words is "twelve trillion, four hundred sixty billion, four hundred sixty-four million, six hundred twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •