Search a number
-
+
19698950 = 2523171179
BaseRepresentation
bin100101100100…
…1010100000110
31101001210212202
41023021110012
520020331300
61542114502
7326303225
oct113112406
941053782
1019698950
1110135127
12671ba32
1341093ab
14288acbc
151ae1ad5
hex12c9506

19698950 has 48 divisors (see below), whose sum is σ = 38568960. Its totient is φ = 7476000.

The previous prime is 19698923. The next prime is 19698961. The reversal of 19698950 is 5989691.

It is a super-2 number, since 2×196989502 = 776097262205000, which contains 22 as substring.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 19698895 and 19698904.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 109961 + ... + 110139.

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

Almost surely, 219698950 is an apocalyptic number.

19698950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

19698950 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 174960, while the sum is 47.

The square root of 19698950 is about 4438.3499186071. The cubic root of 19698950 is about 270.0729112648.

The spelling of 19698950 in words is "nineteen million, six hundred ninety-eight thousand, nine hundred fifty".

Divisors: 1 2 5 10 25 31 50 62 71 142 155 179 310 355 358 710 775 895 1550 1775 1790 2201 3550 4402 4475 5549 8950 11005 11098 12709 22010 25418 27745 55025 55490 63545 110050 127090 138725 277450 317725 393979 635450 787958 1969895 3939790 9849475 19698950