Search a number
-
+
48399695 = 529333791
BaseRepresentation
bin1011100010100…
…0010101001111
310101001221220022
42320220111033
544342242240
64445212355
71125250661
oct270502517
9111057808
1048399695
1125358453
12142610bb
13a047b96
1465dc531
1543b09b5
hex2e2854f

48399695 has 8 divisors (see below), whose sum is σ = 60082560. Its totient is φ = 37384480.

The previous prime is 48399679. The next prime is 48399719. The reversal of 48399695 is 59699384.

48399695 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 48399695 - 24 = 48399679 is a prime.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 166751 + ... + 167040.

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

Almost surely, 248399695 is an apocalyptic number.

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

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

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

The sum of its prime factors is 333825.

The product of its digits is 2099520, while the sum is 53.

The square root of 48399695 is about 6956.9889320021. The cubic root of 48399695 is about 364.4300732120.

It can be divided in two parts, 48399 and 695, that added together give a palindrome (49094).

The spelling of 48399695 in words is "forty-eight million, three hundred ninety-nine thousand, six hundred ninety-five".

Divisors: 1 5 29 145 333791 1668955 9679939 48399695