Base | Representation |
---|---|
bin | 100111110001… |
… | …1111000111001 |
3 | 1110020121120102 |
4 | 1033203320321 |
5 | 20314401002 |
6 | 2023005145 |
7 | 342163523 |
oct | 117437071 |
9 | 43217512 |
10 | 20856377 |
11 | 10855783 |
12 | 6b997b5 |
13 | 4423169 |
14 | 2aaca13 |
15 | 1c6ea02 |
hex | 13e3e39 |
20856377 has 8 divisors (see below), whose sum is σ = 21850560. Its totient is φ = 19869520.
The previous prime is 20856371. The next prime is 20856383. The reversal of 20856377 is 77365802.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20856371) and next prime (20856383).
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 20856377 - 212 = 20852281 is a prime.
It is a super-2 number, since 2×208563772 = 869976923132258, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20856377.
It is not an unprimeable number, because it can be changed into a prime (20856371) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4502 + ... + 7872.
It is an arithmetic number, because the mean of its divisors is an integer number (2731320).
Almost surely, 220856377 is an apocalyptic number.
It is an amenable number.
20856377 is a deficient number, since it is larger than the sum of its proper divisors (994183).
20856377 is a wasteful number, since it uses less digits than its factorization.
20856377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3663.
The product of its (nonzero) digits is 70560, while the sum is 38.
The square root of 20856377 is about 4566.8782554388. The cubic root of 20856377 is about 275.2620180404.
The spelling of 20856377 in words is "twenty million, eight hundred fifty-six thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •