Search a number
-
+
507979133141 = 2322086049267
BaseRepresentation
bin1110110010001011110…
…10100111000011010101
31210120011221100200012012
413121011322213003111
531310320124230031
61025210135434005
751462124250234
oct7310572470325
91716157320165
10507979133141
11186483a83307
1282549225905
1338b9626602c
141a82cc18b1b
15d3313aab2b
hex7645ea70d5

507979133141 has 4 divisors (see below), whose sum is σ = 530065182432. Its totient is φ = 485893083852.

The previous prime is 507979133089. The next prime is 507979133173. The reversal of 507979133141 is 141331979705.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-507979133141 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11043024611 + ... + 11043024656.

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

Almost surely, 2507979133141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 22086049290.

The product of its (nonzero) digits is 714420, while the sum is 50.

The spelling of 507979133141 in words is "five hundred seven billion, nine hundred seventy-nine million, one hundred thirty-three thousand, one hundred forty-one".

Divisors: 1 23 22086049267 507979133141