Base | Representation |
---|---|
bin | 100110011000… |
… | …1110000101001 |
3 | 1101212112201121 |
4 | 1030301300221 |
5 | 20123024021 |
6 | 1555215241 |
7 | 333034414 |
oct | 114616051 |
9 | 41775647 |
10 | 20126761 |
11 | 103a7596 |
12 | 68a7521 |
13 | 4229035 |
14 | 295cb7b |
15 | 1b78741 |
hex | 1331c29 |
20126761 has 2 divisors, whose sum is σ = 20126762. Its totient is φ = 20126760.
The previous prime is 20126749. The next prime is 20126801. The reversal of 20126761 is 16762102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11861136 + 8265625 = 3444^2 + 2875^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20126761 is a prime.
It is a super-2 number, since 2×201267612 = 810173016702242, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20126731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10063380 + 10063381.
It is an arithmetic number, because the mean of its divisors is an integer number (10063381).
Almost surely, 220126761 is an apocalyptic number.
It is an amenable number.
20126761 is a deficient number, since it is larger than the sum of its proper divisors (1).
20126761 is an equidigital number, since it uses as much as digits as its factorization.
20126761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
The square root of 20126761 is about 4486.2858803246. The cubic root of 20126761 is about 272.0140248319.
Adding to 20126761 its reverse (16762102), we get a palindrome (36888863).
It can be divided in two parts, 201 and 26761, that added together give a palindrome (26962).
The spelling of 20126761 in words is "twenty million, one hundred twenty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •