Base | Representation |
---|---|
bin | 100110001011… |
… | …1110111110111 |
3 | 1101200011021102 |
4 | 1030113313313 |
5 | 20111130402 |
6 | 1553040315 |
7 | 332113316 |
oct | 114276767 |
9 | 41604242 |
10 | 20020727 |
11 | 10334961 |
12 | 685609b |
13 | 41bc9ac |
14 | 293227d |
15 | 1b57102 |
hex | 1317df7 |
20020727 has 4 divisors (see below), whose sum is σ = 20071056. Its totient is φ = 19970400.
The previous prime is 20020723. The next prime is 20020753. The reversal of 20020727 is 72702002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 72702002 = 2 ⋅36351001.
It is a cyclic number.
It is not a de Polignac number, because 20020727 - 22 = 20020723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20020699 and 20020708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24563 + ... + 25364.
It is an arithmetic number, because the mean of its divisors is an integer number (5017764).
Almost surely, 220020727 is an apocalyptic number.
20020727 is a deficient number, since it is larger than the sum of its proper divisors (50329).
20020727 is an equidigital number, since it uses as much as digits as its factorization.
20020727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50328.
The product of its (nonzero) digits is 392, while the sum is 20.
The square root of 20020727 is about 4474.4527039628. The cubic root of 20020727 is about 271.5354988420.
Adding to 20020727 its reverse (72702002), we get a palindrome (92722729).
The spelling of 20020727 in words is "twenty million, twenty thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •