Search a number
-
+
48599034971 = 173823747781
BaseRepresentation
bin101101010000101110…
…100110110001011011
311122102221122202220012
4231100232212301123
51244012323104341
634154233552135
73340220660414
oct552056466133
9148387582805
1048599034971
1119679985313
12950387564b
134776743c36
1424d064a80b
1513e68ae0eb
hexb50ba6c5b

48599034971 has 8 divisors (see below), whose sum is σ = 51471330624. Its totient is φ = 45728242560.

The previous prime is 48599034959. The next prime is 48599034989. The reversal of 48599034971 is 17943099584.

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 48599034971 - 26 = 48599034907 is a prime.

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

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 48599034971.

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

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

Almost surely, 248599034971 is an apocalyptic number.

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

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

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

The sum of its prime factors is 751621.

The product of its (nonzero) digits is 9797760, while the sum is 59.

The spelling of 48599034971 in words is "forty-eight billion, five hundred ninety-nine million, thirty-four thousand, nine hundred seventy-one".

Divisors: 1 17 3823 64991 747781 12712277 2858766763 48599034971