Base | Representation |
---|---|
bin | 100110011000… |
… | …0000001110111 |
3 | 1101212012000000 |
4 | 1030300001313 |
5 | 20122312141 |
6 | 1555122343 |
7 | 333004635 |
oct | 114600167 |
9 | 41765000 |
10 | 20119671 |
11 | 103a2230 |
12 | 68a33b3 |
13 | 4225a40 |
14 | 295a355 |
15 | 1b765b6 |
hex | 1330077 |
20119671 has 56 divisors (see below), whose sum is σ = 35623056. Its totient is φ = 11197440.
The previous prime is 20119661. The next prime is 20119681. The reversal of 20119671 is 17691102.
It is an interprime number because it is at equal distance from previous prime (20119661) and next prime (20119681).
It is not a de Polignac number, because 20119671 - 25 = 20119639 is a prime.
It is a super-3 number, since 3×201196713 (a number of 23 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20119621) 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 in 55 ways as a sum of consecutive naturals, for example, 104151 + ... + 104343.
It is an arithmetic number, because the mean of its divisors is an integer number (636126).
Almost surely, 220119671 is an apocalyptic number.
20119671 is a deficient number, since it is larger than the sum of its proper divisors (15503385).
20119671 is a wasteful number, since it uses less digits than its factorization.
20119671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235 (or 220 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The square root of 20119671 is about 4485.4956247889. The cubic root of 20119671 is about 271.9820805308.
The spelling of 20119671 in words is "twenty million, one hundred nineteen thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •