Base | Representation |
---|---|
bin | 1000000110110000100… |
… | …0101101010000111001 |
3 | 111022102210102020221002 |
4 | 2001230020231100321 |
5 | 4240142303102403 |
6 | 143545542454345 |
7 | 13026552313655 |
oct | 2015410552071 |
9 | 438383366832 |
10 | 139253175353 |
11 | 54069872796 |
12 | 22ba37343b5 |
13 | 10192c39916 |
14 | 6a50385a65 |
15 | 39503a0188 |
hex | 206c22d439 |
139253175353 has 2 divisors, whose sum is σ = 139253175354. Its totient is φ = 139253175352.
The previous prime is 139253175343. The next prime is 139253175361. The reversal of 139253175353 is 353571352931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139149888784 + 103286569 = 373028^2 + 10163^2 .
It is a cyclic number.
It is not a de Polignac number, because 139253175353 - 218 = 139252913209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 139253175298 and 139253175307.
It is not a weakly prime, because it can be changed into another prime (139253175343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69626587676 + 69626587677.
It is an arithmetic number, because the mean of its divisors is an integer number (69626587677).
Almost surely, 2139253175353 is an apocalyptic number.
It is an amenable number.
139253175353 is a deficient number, since it is larger than the sum of its proper divisors (1).
139253175353 is an equidigital number, since it uses as much as digits as its factorization.
139253175353 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1275750, while the sum is 47.
The spelling of 139253175353 in words is "one hundred thirty-nine billion, two hundred fifty-three million, one hundred seventy-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •