Search a number
-
+
319316945195 = 5552111567359
BaseRepresentation
bin1001010010110001100…
…01011110100100101011
31010112012202011111221202
410221120301132210223
520212430114221240
6402405302154415
732032654151663
oct4513061364453
91115182144852
10319316945195
11113470100116
1251a76722a0b
132415ab4acb1
14116528211a3
15848d4a3315
hex4a58c5e92b

319316945195 has 8 divisors (see below), whose sum is σ = 383249771520. Its totient is φ = 255407264640.

The previous prime is 319316945191. The next prime is 319316945221. The reversal of 319316945195 is 591549613913.

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

It is not a de Polignac number, because 319316945195 - 22 = 319316945191 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 319316945195.

It is not an unprimeable number, because it can be changed into a prime (319316945191) 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 7 ways as a sum of consecutive naturals, for example, 5756075 + ... + 5811284.

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

Almost surely, 2319316945195 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11572885.

The product of its digits is 3936600, while the sum is 56.

The spelling of 319316945195 in words is "three hundred nineteen billion, three hundred sixteen million, nine hundred forty-five thousand, one hundred ninety-five".

Divisors: 1 5 5521 27605 11567359 57836795 63863389039 319316945195