Search a number
-
+
49556010061 = 82847598163
BaseRepresentation
bin101110001001110001…
…001011010001001101
311201220122101010221001
4232021301023101031
51302442314310221
634433221140301
73403021064305
oct561161132115
9151818333831
1049556010061
111a020091918
12973025a691
134899a9879c
142581798605
1514508e2391
hexb89c4b44d

49556010061 has 4 divisors (see below), whose sum is σ = 49556691072. Its totient is φ = 49555329052.

The previous prime is 49556009959. The next prime is 49556010103. The reversal of 49556010061 is 16001065594.

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 49556010061 - 29 = 49556009549 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 49556010061.

It is a congruent number.

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

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

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

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

Almost surely, 249556010061 is an apocalyptic number.

It is an amenable number.

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

49556010061 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 681010.

The product of its (nonzero) digits is 32400, while the sum is 37.

The spelling of 49556010061 in words is "forty-nine billion, five hundred fifty-six million, ten thousand, sixty-one".

Divisors: 1 82847 598163 49556010061