Base | Representation |
---|---|
bin | 1011011011010001000100… |
… | …0101101110011100110101 |
3 | 1122111000110200012022210112 |
4 | 2312310101011232130311 |
5 | 3121313124402220303 |
6 | 42415220505432405 |
7 | 2434436326344005 |
oct | 266642105563465 |
9 | 48430420168715 |
10 | 12563066054453 |
11 | 4003a6a2a6462 |
12 | 14aa98149b705 |
13 | 7018cc568a35 |
14 | 3160ac974005 |
15 | 16bbda5470d8 |
hex | b6d1116e735 |
12563066054453 has 2 divisors, whose sum is σ = 12563066054454. Its totient is φ = 12563066054452.
The previous prime is 12563066054443. The next prime is 12563066054459. The reversal of 12563066054453 is 35445066036521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12477122096209 + 85943958244 = 3532297^2 + 293162^2 .
It is a cyclic number.
It is not a de Polignac number, because 12563066054453 - 24 = 12563066054437 is a prime.
It is a super-2 number, since 2×125630660544532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12563066054459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6281533027226 + 6281533027227.
It is an arithmetic number, because the mean of its divisors is an integer number (6281533027227).
Almost surely, 212563066054453 is an apocalyptic number.
It is an amenable number.
12563066054453 is a deficient number, since it is larger than the sum of its proper divisors (1).
12563066054453 is an equidigital number, since it uses as much as digits as its factorization.
12563066054453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776000, while the sum is 50.
The spelling of 12563066054453 in words is "twelve trillion, five hundred sixty-three billion, sixty-six million, fifty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •