Search a number
-
+
49004466044447 = 157312130356971
BaseRepresentation
bin10110010010001101111011…
…10010100111111000011111
320102111210002111101101220102
423021012331302213320133
522410342121301410242
6252120201345411315
713215312231420614
oct1311067562477037
9212453074341812
1049004466044447
111468374a5a1521
1255b5488639b3b
1321461417a26b4
14c15b8638c50b
1559eaba52ae32
hex2c91bdca7e1f

49004466044447 has 4 divisors (see below), whose sum is σ = 49316596401576. Its totient is φ = 48692335687320.

The previous prime is 49004466044383. The next prime is 49004466044507. The reversal of 49004466044447 is 74444066440094.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 49004466044447 - 26 = 49004466044383 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 49004466044392 and 49004466044401.

It is a congruent number.

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

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

Almost surely, 249004466044447 is an apocalyptic number.

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

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

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

The sum of its prime factors is 312130357128.

The product of its (nonzero) digits is 37158912, while the sum is 56.

The spelling of 49004466044447 in words is "forty-nine trillion, four billion, four hundred sixty-six million, forty-four thousand, four hundred forty-seven".

Divisors: 1 157 312130356971 49004466044447