Base | Representation |
---|---|
bin | 10000101000111… |
… | …00000110010101 |
3 | 100201122011212102 |
4 | 20110130012111 |
5 | 241212410301 |
6 | 21503331445 |
7 | 3313242146 |
oct | 1024340625 |
9 | 321564772 |
10 | 139575701 |
11 | 71872321 |
12 | 3a8b0b85 |
13 | 22bbc195 |
14 | 14773acd |
15 | c3c0b6b |
hex | 851c195 |
139575701 has 2 divisors, whose sum is σ = 139575702. Its totient is φ = 139575700.
The previous prime is 139575697. The next prime is 139575703. The reversal of 139575701 is 107575931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77968900 + 61606801 = 8830^2 + 7849^2 .
It is a cyclic number.
It is not a de Polignac number, because 139575701 - 22 = 139575697 is a prime.
It is a Sophie Germain prime.
Together with 139575703, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139575703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69787850 + 69787851.
It is an arithmetic number, because the mean of its divisors is an integer number (69787851).
Almost surely, 2139575701 is an apocalyptic number.
It is an amenable number.
139575701 is a deficient number, since it is larger than the sum of its proper divisors (1).
139575701 is an equidigital number, since it uses as much as digits as its factorization.
139575701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33075, while the sum is 38.
The square root of 139575701 is about 11814.2160552446. The cubic root of 139575701 is about 518.7243150587.
The spelling of 139575701 in words is "one hundred thirty-nine million, five hundred seventy-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •