Search a number
-
+
950019839965 = 5727143423999
BaseRepresentation
bin11011101001100011001…
…10000101011111011101
310100211011111221020011201
431310301212011133131
5111031120034334330
62004233314115501
7125431243254520
oct15646146053735
93324144836151
10950019839965
113369a0483a09
1213415387bb91
136b781684451
1433da45dcbb7
1519aa39deeca
hexdd319857dd

950019839965 has 8 divisors (see below), whose sum is σ = 1302884352000. Its totient is φ = 651442175952.

The previous prime is 950019839953. The next prime is 950019840001. The reversal of 950019839965 is 569938910059.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 950019839965 - 27 = 950019839837 is a prime.

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

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13571711965 + ... + 13571712034.

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

Almost surely, 2950019839965 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 27143424011.

The product of its (nonzero) digits is 23619600, while the sum is 64.

The spelling of 950019839965 in words is "nine hundred fifty billion, nineteen million, eight hundred thirty-nine thousand, nine hundred sixty-five".

Divisors: 1 5 7 35 27143423999 135717119995 190003967993 950019839965