Base | Representation |
---|---|
bin | 100110010000… |
… | …0101101110111 |
3 | 1101201222222001 |
4 | 1030200231313 |
5 | 20113310301 |
6 | 1553520131 |
7 | 332324035 |
oct | 114405567 |
9 | 41658861 |
10 | 20056951 |
11 | 1035a0a2 |
12 | 6873047 |
13 | 4203325 |
14 | 2941555 |
15 | 1b62c01 |
hex | 1320b77 |
20056951 has 16 divisors (see below), whose sum is σ = 22140000. Its totient is φ = 18095616.
The previous prime is 20056903. The next prime is 20056961. The reversal of 20056951 is 15965002.
It is a cyclic number.
It is not a de Polignac number, because 20056951 - 217 = 19925879 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20056961) 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 in 15 ways as a sum of consecutive naturals, for example, 48835 + ... + 49243.
It is an arithmetic number, because the mean of its divisors is an integer number (1383750).
Almost surely, 220056951 is an apocalyptic number.
20056951 is a deficient number, since it is larger than the sum of its proper divisors (2083049).
20056951 is a wasteful number, since it uses less digits than its factorization.
20056951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 20056951 is about 4478.4987439989. The cubic root of 20056951 is about 271.6991654866.
The spelling of 20056951 in words is "twenty million, fifty-six thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •