Base | Representation |
---|---|
bin | 1000000110110000100… |
… | …0101101010001000001 |
3 | 111022102210102020221101 |
4 | 2001230020231101001 |
5 | 4240142303102421 |
6 | 143545542454401 |
7 | 13026552313666 |
oct | 2015410552101 |
9 | 438383366841 |
10 | 139253175361 |
11 | 540698727a3 |
12 | 22ba3734401 |
13 | 10192c39921 |
14 | 6a50385a6d |
15 | 39503a0191 |
hex | 206c22d441 |
139253175361 has 2 divisors, whose sum is σ = 139253175362. Its totient is φ = 139253175360.
The previous prime is 139253175353. The next prime is 139253175371. The reversal of 139253175361 is 163571352931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94590693136 + 44662482225 = 307556^2 + 211335^2 .
It is a cyclic number.
It is not a de Polignac number, because 139253175361 - 23 = 139253175353 is a prime.
It is not a weakly prime, because it can be changed into another prime (139253175371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69626587680 + 69626587681.
It is an arithmetic number, because the mean of its divisors is an integer number (69626587681).
Almost surely, 2139253175361 is an apocalyptic number.
It is an amenable number.
139253175361 is a deficient number, since it is larger than the sum of its proper divisors (1).
139253175361 is an equidigital number, since it uses as much as digits as its factorization.
139253175361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 510300, while the sum is 46.
The spelling of 139253175361 in words is "one hundred thirty-nine billion, two hundred fifty-three million, one hundred seventy-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •