Base | Representation |
---|---|
bin | 1000000011000001011… |
… | …1011000111101111001 |
3 | 111012211220111112222022 |
4 | 2000300113120331321 |
5 | 4231114100011132 |
6 | 143302241404225 |
7 | 12662654636435 |
oct | 2006027307571 |
9 | 435756445868 |
10 | 138250391417 |
11 | 536a4818336 |
12 | 22963939675 |
13 | 10063266548 |
14 | 69971119c5 |
15 | 38e231de12 |
hex | 20305d8f79 |
138250391417 has 2 divisors, whose sum is σ = 138250391418. Its totient is φ = 138250391416.
The previous prime is 138250391401. The next prime is 138250391471. The reversal of 138250391417 is 714193052831.
Together with next prime (138250391471) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73215701056 + 65034690361 = 270584^2 + 255019^2 .
It is an emirp because it is prime and its reverse (714193052831) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 138250391417 - 24 = 138250391401 is a prime.
It is a super-2 number, since 2×1382503914172 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (138250391717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69125195708 + 69125195709.
It is an arithmetic number, because the mean of its divisors is an integer number (69125195709).
Almost surely, 2138250391417 is an apocalyptic number.
It is an amenable number.
138250391417 is a deficient number, since it is larger than the sum of its proper divisors (1).
138250391417 is an equidigital number, since it uses as much as digits as its factorization.
138250391417 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 181440, while the sum is 44.
The spelling of 138250391417 in words is "one hundred thirty-eight billion, two hundred fifty million, three hundred ninety-one thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •