Search a number
-
+
48576762381 = 3723100573007
BaseRepresentation
bin101101001111011001…
…101001001000001101
311122101101202012122110
4231033121221020031
51243441122344011
634152120334233
73336530444640
oct551731511015
9148341665573
1048576762381
1119668352614
1294b8314379
134771c462a4
1424cb6cda57
1513e495eba6
hexb4f66920d

48576762381 has 16 divisors (see below), whose sum is σ = 77240070144. Its totient is φ = 26551273584.

The previous prime is 48576762349. The next prime is 48576762449. The reversal of 48576762381 is 18326767584.

48576762381 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 48576762381 - 25 = 48576762349 is a prime.

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

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50286021 + ... + 50286986.

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

Almost surely, 248576762381 is an apocalyptic number.

It is an amenable number.

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

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

48576762381 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 100573040.

The product of its digits is 13547520, while the sum is 57.

The spelling of 48576762381 in words is "forty-eight billion, five hundred seventy-six million, seven hundred sixty-two thousand, three hundred eighty-one".

Divisors: 1 3 7 21 23 69 161 483 100573007 301719021 704011049 2112033147 2313179161 6939537483 16192254127 48576762381