Search a number
-
+
48516151 = 353913709
BaseRepresentation
bin1011100100010…
…0110000110111
310101021212122111
42321010300313
544410004101
64451511451
71126244335
oct271046067
9111255574
1048516151
11254279a2
12142b8587
13a088ba8
14662cb55
1543d5251
hex2e44c37

48516151 has 4 divisors (see below), whose sum is σ = 48533400. Its totient is φ = 48498904.

The previous prime is 48516133. The next prime is 48516187. The reversal of 48516151 is 15161584.

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

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 48516151 - 29 = 48515639 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (48516751) by changing a digit.

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 3 ways as a sum of consecutive naturals, for example, 3316 + ... + 10393.

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

Almost surely, 248516151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17248.

The product of its digits is 4800, while the sum is 31.

The square root of 48516151 is about 6965.3536162926. The cubic root of 48516151 is about 364.7221279123.

The spelling of 48516151 in words is "forty-eight million, five hundred sixteen thousand, one hundred fifty-one".

Divisors: 1 3539 13709 48516151