Base | Representation |
---|---|
bin | 100110011011… |
… | …0001101000001 |
3 | 1101220110200200 |
4 | 1030312031001 |
5 | 20124114321 |
6 | 1555435413 |
7 | 333141444 |
oct | 114661501 |
9 | 41813620 |
10 | 20144961 |
11 | 1040a231 |
12 | 68b5b69 |
13 | 42343c5 |
14 | 296565b |
15 | 1b7dd26 |
hex | 1336341 |
20144961 has 12 divisors (see below), whose sum is σ = 29253120. Its totient is φ = 13358520.
The previous prime is 20144951. The next prime is 20144963. The reversal of 20144961 is 16944102.
It is not a de Polignac number, because 20144961 - 27 = 20144833 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20144963) 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 11 ways as a sum of consecutive naturals, for example, 4141 + ... + 7578.
It is an arithmetic number, because the mean of its divisors is an integer number (2437760).
Almost surely, 220144961 is an apocalyptic number.
It is an amenable number.
20144961 is a deficient number, since it is larger than the sum of its proper divisors (9108159).
20144961 is a wasteful number, since it uses less digits than its factorization.
20144961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11916 (or 11913 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 20144961 is about 4488.3138259262. The cubic root of 20144961 is about 272.0959913865.
The spelling of 20144961 in words is "twenty million, one hundred forty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •