Search a number
-
+
59013139477 = 591000222703
BaseRepresentation
bin110110111101011101…
…010000110000010101
312122022201122002121111
4312331131100300111
51431324330430402
643035452215021
74156254260215
oct667535206025
9178281562544
1059013139477
1123033419156
12b52b46a471
135746170856
142bdb7a6245
151805cb99d7
hexdbd750c15

59013139477 has 4 divisors (see below), whose sum is σ = 60013362240. Its totient is φ = 58012916716.

The previous prime is 59013139463. The next prime is 59013139481. The reversal of 59013139477 is 77493131095.

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 not a de Polignac number, because 59013139477 - 211 = 59013137429 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 259013139477 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1000222762.

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

The spelling of 59013139477 in words is "fifty-nine billion, thirteen million, one hundred thirty-nine thousand, four hundred seventy-seven".

Divisors: 1 59 1000222703 59013139477