Search a number
-
+
20963151 = 331170583
BaseRepresentation
bin100111111110…
…1111101001111
31110110001001000
41033331331033
520331310101
62025151343
7343120026
oct117757517
943401030
1020963151
1110918a20
12702b553
13445c941
142ad98bd
151c91486
hex13fdf4f

20963151 has 16 divisors (see below), whose sum is σ = 33880320. Its totient is φ = 12704760.

The previous prime is 20963147. The next prime is 20963171. The reversal of 20963151 is 15136902.

20963151 is a `hidden beast` number, since 20 + 9 + 631 + 5 + 1 = 666.

It is not a de Polignac number, because 20963151 - 22 = 20963147 is a prime.

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 (20963101) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34995 + ... + 35588.

It is an arithmetic number, because the mean of its divisors is an integer number (2117520).

Almost surely, 220963151 is an apocalyptic number.

20963151 is a deficient number, since it is larger than the sum of its proper divisors (12917169).

20963151 is a wasteful number, since it uses less digits than its factorization.

20963151 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 70603 (or 70597 counting only the distinct ones).

The product of its (nonzero) digits is 1620, while the sum is 27.

The square root of 20963151 is about 4578.5533741565. The cubic root of 20963151 is about 275.7309523706.

The spelling of 20963151 in words is "twenty million, nine hundred sixty-three thousand, one hundred fifty-one".

Divisors: 1 3 9 11 27 33 99 297 70583 211749 635247 776413 1905741 2329239 6987717 20963151