Base | Representation |
---|---|
bin | 10000100001000… |
… | …01101101110101 |
3 | 100122201002001102 |
4 | 20100201231311 |
5 | 240432101013 |
6 | 21425335445 |
7 | 3301441151 |
oct | 1020415565 |
9 | 318632042 |
10 | 138550133 |
11 | 71231847 |
12 | 3a497585 |
13 | 22920437 |
14 | 14588061 |
15 | c26bd58 |
hex | 8421b75 |
138550133 has 2 divisors, whose sum is σ = 138550134. Its totient is φ = 138550132.
The previous prime is 138550103. The next prime is 138550169. The reversal of 138550133 is 331055831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132756484 + 5793649 = 11522^2 + 2407^2 .
It is an emirp because it is prime and its reverse (331055831) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-138550133 is a prime.
It is a super-2 number, since 2×1385501332 = 38392278708635378, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 138550096 and 138550105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138550103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69275066 + 69275067.
It is an arithmetic number, because the mean of its divisors is an integer number (69275067).
Almost surely, 2138550133 is an apocalyptic number.
It is an amenable number.
138550133 is a deficient number, since it is larger than the sum of its proper divisors (1).
138550133 is an equidigital number, since it uses as much as digits as its factorization.
138550133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5400, while the sum is 29.
The square root of 138550133 is about 11770.7320503017. The cubic root of 138550133 is about 517.4507042279.
The spelling of 138550133 in words is "one hundred thirty-eight million, five hundred fifty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •