Base | Representation |
---|---|
bin | 11001101000100111… |
… | …10001011000101011 |
3 | 1022112010120110000101 |
4 | 30310103301120223 |
5 | 211141200001024 |
6 | 10153350050231 |
7 | 665022215053 |
oct | 146423613053 |
9 | 38463513011 |
10 | 13762500139 |
11 | 5922633063 |
12 | 2801049977 |
13 | 13b435500b |
14 | 947b32563 |
15 | 55836cc44 |
hex | 3344f162b |
13762500139 has 2 divisors, whose sum is σ = 13762500140. Its totient is φ = 13762500138.
The previous prime is 13762500113. The next prime is 13762500151. The reversal of 13762500139 is 93100526731.
13762500139 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 is a cyclic number.
It is not a de Polignac number, because 13762500139 - 213 = 13762491947 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13762500098 and 13762500107.
It is not a weakly prime, because it can be changed into another prime (13762500239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6881250069 + 6881250070.
It is an arithmetic number, because the mean of its divisors is an integer number (6881250070).
Almost surely, 213762500139 is an apocalyptic number.
13762500139 is a deficient number, since it is larger than the sum of its proper divisors (1).
13762500139 is an equidigital number, since it uses as much as digits as its factorization.
13762500139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34020, while the sum is 37.
The spelling of 13762500139 in words is "thirteen billion, seven hundred sixty-two million, five hundred thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •