Base | Representation |
---|---|
bin | 10011011111101110101… |
… | …001011001100100100011 |
3 | 11202002002200122111102022 |
4 | 103133232221121210203 |
5 | 133422241044042412 |
6 | 2503244545012055 |
7 | 165535654464362 |
oct | 23375651314443 |
9 | 4662080574368 |
10 | 1339738659107 |
11 | 4771a8600a22 |
12 | 19779792402b |
13 | 9944bc96304 |
14 | 48bb51677d9 |
15 | 24cb29d7a72 |
hex | 137eea59923 |
1339738659107 has 2 divisors, whose sum is σ = 1339738659108. Its totient is φ = 1339738659106.
The previous prime is 1339738659073. The next prime is 1339738659139. The reversal of 1339738659107 is 7019568379331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1339738659107 - 212 = 1339738655011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1339738659107.
It is not a weakly prime, because it can be changed into another prime (1339738659167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 669869329553 + 669869329554.
It is an arithmetic number, because the mean of its divisors is an integer number (669869329554).
Almost surely, 21339738659107 is an apocalyptic number.
1339738659107 is a deficient number, since it is larger than the sum of its proper divisors (1).
1339738659107 is an equidigital number, since it uses as much as digits as its factorization.
1339738659107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25719120, while the sum is 62.
The spelling of 1339738659107 in words is "one trillion, three hundred thirty-nine billion, seven hundred thirty-eight million, six hundred fifty-nine thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •