Base | Representation |
---|---|
bin | 10010010010111011001… |
… | …011001100111000000101 |
3 | 11110012020100200102211222 |
4 | 102102323023030320011 |
5 | 131044342301214044 |
6 | 2401325431010125 |
7 | 156556224562064 |
oct | 22227313147005 |
9 | 4405210612758 |
10 | 1257270726149 |
11 | 445229603329 |
12 | 183801509945 |
13 | 9173877bb49 |
14 | 44bd07281db |
15 | 22a87a248ee |
hex | 124bb2cce05 |
1257270726149 has 2 divisors, whose sum is σ = 1257270726150. Its totient is φ = 1257270726148.
The previous prime is 1257270726121. The next prime is 1257270726157. The reversal of 1257270726149 is 9416270727521.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 747910173124 + 509360553025 = 864818^2 + 713695^2 .
It is a cyclic number.
It is not a de Polignac number, because 1257270726149 - 212 = 1257270722053 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1257270726149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1257270726199) 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, 628635363074 + 628635363075.
It is an arithmetic number, because the mean of its divisors is an integer number (628635363075).
Almost surely, 21257270726149 is an apocalyptic number.
It is an amenable number.
1257270726149 is a deficient number, since it is larger than the sum of its proper divisors (1).
1257270726149 is an equidigital number, since it uses as much as digits as its factorization.
1257270726149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2963520, while the sum is 53.
The spelling of 1257270726149 in words is "one trillion, two hundred fifty-seven billion, two hundred seventy million, seven hundred twenty-six thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •