Base | Representation |
---|---|
bin | 100110011110… |
… | …0110100000101 |
3 | 1101221211211111 |
4 | 1030330310011 |
5 | 20131001122 |
6 | 2000205021 |
7 | 333313414 |
oct | 114746405 |
9 | 41854744 |
10 | 20172037 |
11 | 10428606 |
12 | 6909771 |
13 | 4243822 |
14 | 297147b |
15 | 1b86d77 |
hex | 133cd05 |
20172037 has 2 divisors, whose sum is σ = 20172038. Its totient is φ = 20172036.
The previous prime is 20172007. The next prime is 20172073. The reversal of 20172037 is 73027102.
Together with next prime (20172073) 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., 19351201 + 820836 = 4399^2 + 906^2 .
It is a cyclic number.
It is not a de Polignac number, because 20172037 - 215 = 20139269 is a prime.
It is a super-2 number, since 2×201720372 = 813822153458738, 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 = 20171999 and 20172017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20172007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10086018 + 10086019.
It is an arithmetic number, because the mean of its divisors is an integer number (10086019).
Almost surely, 220172037 is an apocalyptic number.
It is an amenable number.
20172037 is a deficient number, since it is larger than the sum of its proper divisors (1).
20172037 is an equidigital number, since it uses as much as digits as its factorization.
20172037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 588, while the sum is 22.
The square root of 20172037 is about 4491.3290905922. The cubic root of 20172037 is about 272.2178410944.
Adding to 20172037 its reverse (73027102), we get a palindrome (93199139).
The spelling of 20172037 in words is "twenty million, one hundred seventy-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •