Base | Representation |
---|---|
bin | 10000101001101… |
… | …01101101100101 |
3 | 100201211111210001 |
4 | 20110311231211 |
5 | 241224234423 |
6 | 21505501301 |
7 | 3314160052 |
oct | 1024655545 |
9 | 321744701 |
10 | 139680613 |
11 | 71934126 |
12 | 3a941831 |
13 | 22c27b67 |
14 | 147a0029 |
15 | c3e1cad |
hex | 8535b65 |
139680613 has 2 divisors, whose sum is σ = 139680614. Its totient is φ = 139680612.
The previous prime is 139680547. The next prime is 139680623. The reversal of 139680613 is 316086931.
139680613 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104182849 + 35497764 = 10207^2 + 5958^2 .
It is an emirp because it is prime and its reverse (316086931) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 139680613 - 217 = 139549541 is a prime.
It is equal to p7895125 and since 139680613 and 7895125 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139680623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69840306 + 69840307.
It is an arithmetic number, because the mean of its divisors is an integer number (69840307).
Almost surely, 2139680613 is an apocalyptic number.
It is an amenable number.
139680613 is a deficient number, since it is larger than the sum of its proper divisors (1).
139680613 is an equidigital number, since it uses as much as digits as its factorization.
139680613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 37.
The square root of 139680613 is about 11818.6552957602. The cubic root of 139680613 is about 518.8542487926.
The spelling of 139680613 in words is "one hundred thirty-nine million, six hundred eighty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •