Search a number
-
+
48511531 = 236171487
BaseRepresentation
bin1011100100001…
…1101000101011
310101021122022101
42321003220223
544404332111
64451434231
71126225015
oct271035053
9111248271
1048511531
1125424482
12142b5977
13a086a63
14662b1b5
1543d3bc1
hex2e43a2b

48511531 has 16 divisors (see below), whose sum is σ = 52282368. Its totient is φ = 44906400.

The previous prime is 48511499. The next prime is 48511537. The reversal of 48511531 is 13511584.

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

It is a cyclic number.

It is not a de Polignac number, because 48511531 - 25 = 48511499 is a prime.

It is a super-2 number, since 2×485115312 = 4706737279927922, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 48511531.

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

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

Almost surely, 248511531 is an apocalyptic number.

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

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

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

The sum of its prime factors is 642.

The product of its digits is 2400, while the sum is 28.

The square root of 48511531 is about 6965.0219669431. The cubic root of 48511531 is about 364.7105505325.

The spelling of 48511531 in words is "forty-eight million, five hundred eleven thousand, five hundred thirty-one".

Divisors: 1 23 61 71 487 1403 1633 4331 11201 29707 34577 99613 683261 795271 2109197 48511531