Base | Representation |
---|---|
bin | 1000000011011111010… |
… | …1010000010100110101 |
3 | 111020011122012220100001 |
4 | 2000313311100110311 |
5 | 4231343132121403 |
6 | 143322514351301 |
7 | 12666035465443 |
oct | 2006765202465 |
9 | 436148186301 |
10 | 138375660853 |
11 | 537594a90a1 |
12 | 2299988b531 |
13 | 100831b6a81 |
14 | 69a99ddb93 |
15 | 38ed315c1d |
hex | 2037d50535 |
138375660853 has 2 divisors, whose sum is σ = 138375660854. Its totient is φ = 138375660852.
The previous prime is 138375660851. The next prime is 138375660881. The reversal of 138375660853 is 358066573831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98218306404 + 40157354449 = 313398^2 + 200393^2 .
It is a cyclic number.
It is not a de Polignac number, because 138375660853 - 21 = 138375660851 is a prime.
Together with 138375660851, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 138375660794 and 138375660803.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138375660851) 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, 69187830426 + 69187830427.
It is an arithmetic number, because the mean of its divisors is an integer number (69187830427).
Almost surely, 2138375660853 is an apocalyptic number.
It is an amenable number.
138375660853 is a deficient number, since it is larger than the sum of its proper divisors (1).
138375660853 is an equidigital number, since it uses as much as digits as its factorization.
138375660853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10886400, while the sum is 55.
The spelling of 138375660853 in words is "one hundred thirty-eight billion, three hundred seventy-five million, six hundred sixty thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •