Search a number
-
+
49548971379 = 328158776953
BaseRepresentation
bin101110001001010110…
…010100110101110011
311201220011010112200010
4232021112110311303
51302434014041004
634432410230003
73402604210335
oct561126246563
9151804115603
1049548971379
111a017114626
129729a25303
1348984a2a9b
142580885455
15144eea1a89
hexb89594d73

49548971379 has 8 divisors (see below), whose sum is σ = 66300404112. Its totient is φ = 32915093120.

The previous prime is 49548971357. The next prime is 49548971401. The reversal of 49548971379 is 97317984594.

It is an interprime number because it is at equal distance from previous prime (49548971357) and next prime (49548971401).

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 49548971379 - 212 = 49548967283 is a prime.

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

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

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

Almost surely, 249548971379 is an apocalyptic number.

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

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

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

The sum of its prime factors is 58777237.

The product of its digits is 68584320, while the sum is 66.

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

Divisors: 1 3 281 843 58776953 176330859 16516323793 49548971379