Search a number
-
+
48570731 = 112401411
BaseRepresentation
bin1011100101001…
…0000101101011
310101101122111222
42321102011223
544413230411
64453012255
71126562426
oct271220553
9111348458
1048570731
1125464a00
121432408b
13a0a79a1
1466449bd
1543e64db
hex2e5216b

48570731 has 6 divisors (see below), whose sum is σ = 53387796. Its totient is φ = 44155100.

The previous prime is 48570719. The next prime is 48570749. The reversal of 48570731 is 13707584.

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

It is not a de Polignac number, because 48570731 - 26 = 48570667 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 48570691 and 48570700.

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

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

Almost surely, 248570731 is an apocalyptic number.

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

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

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

The sum of its prime factors is 401433 (or 401422 counting only the distinct ones).

The product of its (nonzero) digits is 23520, while the sum is 35.

The square root of 48570731 is about 6969.2704783212. The cubic root of 48570731 is about 364.8588457759.

The spelling of 48570731 in words is "forty-eight million, five hundred seventy thousand, seven hundred thirty-one".

Divisors: 1 11 121 401411 4415521 48570731