Base | Representation |
---|---|
bin | 10010011010010000001… |
… | …001010101001010111001 |
3 | 11110221112200202110200211 |
4 | 102122100021111022321 |
5 | 131212001010001022 |
6 | 2405110254031121 |
7 | 160255213641403 |
oct | 22322011251271 |
9 | 4427480673624 |
10 | 1265138750137 |
11 | 4485a692a199 |
12 | 1852384a84a1 |
13 | 923c0863c42 |
14 | 45339679b73 |
15 | 22d98650e77 |
hex | 126902552b9 |
1265138750137 has 2 divisors, whose sum is σ = 1265138750138. Its totient is φ = 1265138750136.
The previous prime is 1265138750123. The next prime is 1265138750173. The reversal of 1265138750137 is 7310578315621.
Together with next prime (1265138750173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1261531066041 + 3607684096 = 1123179^2 + 60064^2 .
It is a cyclic number.
It is not a de Polignac number, because 1265138750137 - 231 = 1262991266489 is a prime.
It is not a weakly prime, because it can be changed into another prime (1265138750737) 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, 632569375068 + 632569375069.
It is an arithmetic number, because the mean of its divisors is an integer number (632569375069).
Almost surely, 21265138750137 is an apocalyptic number.
It is an amenable number.
1265138750137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1265138750137 is an equidigital number, since it uses as much as digits as its factorization.
1265138750137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1058400, while the sum is 49.
The spelling of 1265138750137 in words is "one trillion, two hundred sixty-five billion, one hundred thirty-eight million, seven hundred fifty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •