Base | Representation |
---|---|
bin | 1000000100011101110… |
… | …0101100000010111101 |
3 | 111020211220012122110101 |
4 | 2001013130230002331 |
5 | 4232412220000003 |
6 | 143404514041101 |
7 | 13005366430435 |
oct | 2010734540275 |
9 | 436756178411 |
10 | 138637656253 |
11 | 53883385118 |
12 | 22a51579191 |
13 | 100c5569335 |
14 | 69d271d2c5 |
15 | 391631911d |
hex | 204772c0bd |
138637656253 has 2 divisors, whose sum is σ = 138637656254. Its totient is φ = 138637656252.
The previous prime is 138637656251. The next prime is 138637656341. The reversal of 138637656253 is 352656736831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 134921778489 + 3715877764 = 367317^2 + 60958^2 .
It is a cyclic number.
It is not a de Polignac number, because 138637656253 - 21 = 138637656251 is a prime.
Together with 138637656251, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 138637656194 and 138637656203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138637656251) 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, 69318828126 + 69318828127.
It is an arithmetic number, because the mean of its divisors is an integer number (69318828127).
Almost surely, 2138637656253 is an apocalyptic number.
It is an amenable number.
138637656253 is a deficient number, since it is larger than the sum of its proper divisors (1).
138637656253 is an equidigital number, since it uses as much as digits as its factorization.
138637656253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16329600, while the sum is 55.
The spelling of 138637656253 in words is "one hundred thirty-eight billion, six hundred thirty-seven million, six hundred fifty-six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •