Base | Representation |
---|---|
bin | 1101000000101… |
… | …10000000000001 |
3 | 21121100222200221 |
4 | 12200112000001 |
5 | 210420021032 |
6 | 14455143041 |
7 | 2463456205 |
oct | 640260001 |
9 | 247328627 |
10 | 109142017 |
11 | 56676016 |
12 | 30674a81 |
13 | 197c499a |
14 | 106d0b05 |
15 | 98ad597 |
hex | 6816001 |
109142017 has 2 divisors, whose sum is σ = 109142018. Its totient is φ = 109142016.
The previous prime is 109141997. The next prime is 109142021. The reversal of 109142017 is 710241901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99181681 + 9960336 = 9959^2 + 3156^2 .
It is an emirp because it is prime and its reverse (710241901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109142017 - 27 = 109141889 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 109141982 and 109142000.
It is not a weakly prime, because it can be changed into another prime (109142417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54571008 + 54571009.
It is an arithmetic number, because the mean of its divisors is an integer number (54571009).
Almost surely, 2109142017 is an apocalyptic number.
It is an amenable number.
109142017 is a deficient number, since it is larger than the sum of its proper divisors (1).
109142017 is an equidigital number, since it uses as much as digits as its factorization.
109142017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 25.
The square root of 109142017 is about 10447.1056757362. The cubic root of 109142017 is about 477.8929882468.
Adding to 109142017 its reverse (710241901), we get a palindrome (819383918).
The spelling of 109142017 in words is "one hundred nine million, one hundred forty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •