Base | Representation |
---|---|
bin | 100110010000… |
… | …0101101010011 |
3 | 1101201222220201 |
4 | 1030200231103 |
5 | 20113310130 |
6 | 1553520031 |
7 | 332323654 |
oct | 114405523 |
9 | 41658821 |
10 | 20056915 |
11 | 1035a06a |
12 | 6873017 |
13 | 42032c8 |
14 | 294152b |
15 | 1b62bca |
hex | 1320b53 |
20056915 has 8 divisors (see below), whose sum is σ = 24373440. Its totient is φ = 15842112.
The previous prime is 20056903. The next prime is 20056961. The reversal of 20056915 is 51965002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20056915 - 29 = 20056403 is a prime.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 24994 + ... + 25783.
It is an arithmetic number, because the mean of its divisors is an integer number (3046680).
Almost surely, 220056915 is an apocalyptic number.
20056915 is a deficient number, since it is larger than the sum of its proper divisors (4316525).
20056915 is an equidigital number, since it uses as much as digits as its factorization.
20056915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50861.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 20056915 is about 4478.4947247931. The cubic root of 20056915 is about 271.6990029299.
The spelling of 20056915 in words is "twenty million, fifty-six thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •