Base | Representation |
---|---|
bin | 10010010010101011000… |
… | …111101111000001000101 |
3 | 11110011112120212100002011 |
4 | 102102223013233001011 |
5 | 131043314323210312 |
6 | 2401243010014221 |
7 | 156546444312046 |
oct | 22225307570105 |
9 | 4404476770064 |
10 | 1257001381957 |
11 | 445100568022 |
12 | 183747277371 |
13 | 916c4a25699 |
14 | 44ba6a548cd |
15 | 22a6e06dda7 |
hex | 124ab1ef045 |
1257001381957 has 2 divisors, whose sum is σ = 1257001381958. Its totient is φ = 1257001381956.
The previous prime is 1257001381861. The next prime is 1257001381981. The reversal of 1257001381957 is 7591831007521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1205074822081 + 51926559876 = 1097759^2 + 227874^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1257001381957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1257001381957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1257001391957) 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, 628500690978 + 628500690979.
It is an arithmetic number, because the mean of its divisors is an integer number (628500690979).
Almost surely, 21257001381957 is an apocalyptic number.
It is an amenable number.
1257001381957 is a deficient number, since it is larger than the sum of its proper divisors (1).
1257001381957 is an equidigital number, since it uses as much as digits as its factorization.
1257001381957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 529200, while the sum is 49.
The spelling of 1257001381957 in words is "one trillion, two hundred fifty-seven billion, one million, three hundred eighty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •