Base | Representation |
---|---|
bin | 100110010001… |
… | …0101111010101 |
3 | 1101202102022221 |
4 | 1030202233111 |
5 | 20114041422 |
6 | 1554022341 |
7 | 332360143 |
oct | 114425725 |
9 | 41672287 |
10 | 20065237 |
11 | 10365345 |
12 | 68779b1 |
13 | 420702a |
14 | 2944593 |
15 | 1b653c7 |
hex | 1322bd5 |
20065237 has 2 divisors, whose sum is σ = 20065238. Its totient is φ = 20065236.
The previous prime is 20065231. The next prime is 20065247. The reversal of 20065237 is 73256002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15928081 + 4137156 = 3991^2 + 2034^2 .
It is a cyclic number.
It is not a de Polignac number, because 20065237 - 23 = 20065229 is a prime.
It is a super-2 number, since 2×200652372 = 805227471732338, which contains 22 as substring.
It is equal to p1274506 and since 20065237 and 1274506 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20065231) 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, 10032618 + 10032619.
It is an arithmetic number, because the mean of its divisors is an integer number (10032619).
Almost surely, 220065237 is an apocalyptic number.
It is an amenable number.
20065237 is a deficient number, since it is larger than the sum of its proper divisors (1).
20065237 is an equidigital number, since it uses as much as digits as its factorization.
20065237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 25.
The square root of 20065237 is about 4479.4237352588. The cubic root of 20065237 is about 271.7365754488.
It can be divided in two parts, 20065 and 237, that added together give a palindrome (20302).
The spelling of 20065237 in words is "twenty million, sixty-five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •