Base | Representation |
---|---|
bin | 10000011101000… |
… | …00100010011001 |
3 | 100121201012020112 |
4 | 20032200202121 |
5 | 240313133032 |
6 | 21410134105 |
7 | 3264105431 |
oct | 1016404231 |
9 | 317635215 |
10 | 138021017 |
11 | 70a00262 |
12 | 3a281335 |
13 | 22796654 |
14 | 1448b2c1 |
15 | c1b51b2 |
hex | 83a0899 |
138021017 has 2 divisors, whose sum is σ = 138021018. Its totient is φ = 138021016.
The previous prime is 138020969. The next prime is 138021019. The reversal of 138021017 is 710120831.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113656921 + 24364096 = 10661^2 + 4936^2 .
It is a cyclic number.
It is not a de Polignac number, because 138021017 - 210 = 138019993 is a prime.
It is a super-2 number, since 2×1380210172 = 38099602267428578, which contains 22 as substring.
Together with 138021019, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 138020983 and 138021001.
It is not a weakly prime, because it can be changed into another prime (138021019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69010508 + 69010509.
It is an arithmetic number, because the mean of its divisors is an integer number (69010509).
Almost surely, 2138021017 is an apocalyptic number.
It is an amenable number.
138021017 is a deficient number, since it is larger than the sum of its proper divisors (1).
138021017 is an equidigital number, since it uses as much as digits as its factorization.
138021017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 23.
The square root of 138021017 is about 11748.2346333396. The cubic root of 138021017 is about 516.7911578381.
Adding to 138021017 its reverse (710120831), we get a palindrome (848141848).
The spelling of 138021017 in words is "one hundred thirty-eight million, twenty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •