Base | Representation |
---|---|
bin | 1011011000111100010000… |
… | …1100110000001000100001 |
3 | 1122100012100212011211202012 |
4 | 2312033010030300020201 |
5 | 3120134323031020212 |
6 | 42345013104002305 |
7 | 2431523423044211 |
oct | 266170414601041 |
9 | 48305325154665 |
10 | 12523121345057 |
11 | 3a99031582034 |
12 | 14a3094000395 |
13 | 6cac04aa4a0b |
14 | 31419d87a241 |
15 | 16ab4d832922 |
hex | b63c4330221 |
12523121345057 has 2 divisors, whose sum is σ = 12523121345058. Its totient is φ = 12523121345056.
The previous prime is 12523121344973. The next prime is 12523121345101. The reversal of 12523121345057 is 75054312132521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7669775758096 + 4853345586961 = 2769436^2 + 2203031^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12523121345057 is a prime.
It is not a weakly prime, because it can be changed into another prime (12523121342057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6261560672528 + 6261560672529.
It is an arithmetic number, because the mean of its divisors is an integer number (6261560672529).
Almost surely, 212523121345057 is an apocalyptic number.
It is an amenable number.
12523121345057 is a deficient number, since it is larger than the sum of its proper divisors (1).
12523121345057 is an equidigital number, since it uses as much as digits as its factorization.
12523121345057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252000, while the sum is 41.
Adding to 12523121345057 its reverse (75054312132521), we get a palindrome (87577433477578).
The spelling of 12523121345057 in words is "twelve trillion, five hundred twenty-three billion, one hundred twenty-one million, three hundred forty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •