Base | Representation |
---|---|
bin | 10000011101010… |
… | …10111010000101 |
3 | 100121210100111201 |
4 | 20032222322011 |
5 | 240321012433 |
6 | 21411102501 |
7 | 3264343321 |
oct | 1016527205 |
9 | 317710451 |
10 | 138063493 |
11 | 70a2a167 |
12 | 3a2a1a31 |
13 | 227aca99 |
14 | 1449c981 |
15 | c1c2a7d |
hex | 83aae85 |
138063493 has 2 divisors, whose sum is σ = 138063494. Its totient is φ = 138063492.
The previous prime is 138063473. The next prime is 138063509. The reversal of 138063493 is 394360831.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127193284 + 10870209 = 11278^2 + 3297^2 .
It is an emirp because it is prime and its reverse (394360831) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-138063493 is a prime.
It is a super-2 number, since 2×1380634932 = 38123056198722098, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138063473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69031746 + 69031747.
It is an arithmetic number, because the mean of its divisors is an integer number (69031747).
Almost surely, 2138063493 is an apocalyptic number.
It is an amenable number.
138063493 is a deficient number, since it is larger than the sum of its proper divisors (1).
138063493 is an equidigital number, since it uses as much as digits as its factorization.
138063493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 37.
The square root of 138063493 is about 11750.0422552432. The cubic root of 138063493 is about 516.8441666002.
The spelling of 138063493 in words is "one hundred thirty-eight million, sixty-three thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •