Search a number
-
+
49613111415321 = 316537703805107
BaseRepresentation
bin10110100011111011100111…
…11000011101001000011001
320111122222010001000210200220
423101331303320131020121
523000330123010242241
6253303540532150253
713310300102622546
oct1321756370351031
9214588101023626
1049613111415321
1114898890a8a123
12569342a768389
13218b65b595c6c
14c374048d3bcd
155b083e375166
hex2d1f73e1d219

49613111415321 has 4 divisors (see below), whose sum is σ = 66150815220432. Its totient is φ = 33075407610212.

The previous prime is 49613111415289. The next prime is 49613111415349. The reversal of 49613111415321 is 12351411131694.

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 49613111415321 - 25 = 49613111415289 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (49613111413321) 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, 8268851902551 + ... + 8268851902556.

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

Almost surely, 249613111415321 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 16537703805110.

The product of its digits is 77760, while the sum is 42.

The spelling of 49613111415321 in words is "forty-nine trillion, six hundred thirteen billion, one hundred eleven million, four hundred fifteen thousand, three hundred twenty-one".

Divisors: 1 3 16537703805107 49613111415321