Search a number
-
+
16694238950 = 252333884779
BaseRepresentation
bin11111000110000110…
…11101111011100110
31121002110011012121022
433203003131323212
5233142211121300
611400315251142
71130461455404
oct174303357346
947073135538
1016694238950
11709750a8a4
12329aa49ab2
1317608592cc
14b4524a474
1567a92b285
hex3e30ddee6

16694238950 has 12 divisors (see below), whose sum is σ = 31051284540. Its totient is φ = 6677695560.

The previous prime is 16694238929. The next prime is 16694238959. The reversal of 16694238950 is 5983249661.

It is a super-2 number, since 2×166942389502 (a number of 21 digits) contains 22 as substring.

It is a Curzon number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (16694238959) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 166942340 + ... + 166942439.

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

Almost surely, 216694238950 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 2799360, while the sum is 53.

The spelling of 16694238950 in words is "sixteen billion, six hundred ninety-four million, two hundred thirty-eight thousand, nine hundred fifty".

Divisors: 1 2 5 10 25 50 333884779 667769558 1669423895 3338847790 8347119475 16694238950