Base | Representation |
---|---|
bin | 1011101101111010101010… |
… | …0001101000000110111001 |
3 | 1200121122111000201120202022 |
4 | 2323132222201220012321 |
5 | 3142040320233044312 |
6 | 43222330004244225 |
7 | 2466541225645223 |
oct | 273365241500671 |
9 | 50548430646668 |
10 | 12883467862457 |
11 | 4117936812005 |
12 | 1540a9b3a0675 |
13 | 725ba109778a |
14 | 3277c54b3413 |
15 | 1751ddd91172 |
hex | bb7aa8681b9 |
12883467862457 has 2 divisors, whose sum is σ = 12883467862458. Its totient is φ = 12883467862456.
The previous prime is 12883467862409. The next prime is 12883467862487. The reversal of 12883467862457 is 75426876438821.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12875351474176 + 8116388281 = 3588224^2 + 90091^2 .
It is an emirp because it is prime and its reverse (75426876438821) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12883467862457 - 28 = 12883467862201 is a prime.
It is not a weakly prime, because it can be changed into another prime (12883467862487) 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, 6441733931228 + 6441733931229.
It is an arithmetic number, because the mean of its divisors is an integer number (6441733931229).
Almost surely, 212883467862457 is an apocalyptic number.
It is an amenable number.
12883467862457 is a deficient number, since it is larger than the sum of its proper divisors (1).
12883467862457 is an equidigital number, since it uses as much as digits as its factorization.
12883467862457 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 867041280, while the sum is 71.
The spelling of 12883467862457 in words is "twelve trillion, eight hundred eighty-three billion, four hundred sixty-seven million, eight hundred sixty-two thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •