Base | Representation |
---|---|
bin | 10000101001111… |
… | …00000010001011 |
3 | 100201212211022002 |
4 | 20110330002023 |
5 | 241231102012 |
6 | 21510221215 |
7 | 3314325413 |
oct | 1024740213 |
9 | 321784262 |
10 | 139706507 |
11 | 71951626 |
12 | 3a95480b |
13 | 22c36895 |
14 | 147a9643 |
15 | c3e97c2 |
hex | 853c08b |
139706507 has 2 divisors, whose sum is σ = 139706508. Its totient is φ = 139706506.
The previous prime is 139706473. The next prime is 139706521. The reversal of 139706507 is 705607931.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 139706507 - 212 = 139702411 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (139706407) 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, 69853253 + 69853254.
It is an arithmetic number, because the mean of its divisors is an integer number (69853254).
Almost surely, 2139706507 is an apocalyptic number.
139706507 is a deficient number, since it is larger than the sum of its proper divisors (1).
139706507 is an equidigital number, since it uses as much as digits as its factorization.
139706507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39690, while the sum is 38.
The square root of 139706507 is about 11819.7507164914. The cubic root of 139706507 is about 518.8863085550.
The spelling of 139706507 in words is "one hundred thirty-nine million, seven hundred six thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •