Search a number
-
+
48535750753 = 710963611731
BaseRepresentation
bin101101001100111101…
…001100100001100001
311122021112120121021021
4231030331030201201
51243400123011003
634144053325441
73335522034340
oct551475144141
9148245517237
1048535750753
1119647190a06
1294a6636881
1347665b7159
1424c6095b57
1513e105d2bd
hexb4cf4c861

48535750753 has 8 divisors (see below), whose sum is σ = 55978324160. Its totient is φ = 41220401040.

The previous prime is 48535750751. The next prime is 48535750787. The reversal of 48535750753 is 35705753584.

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

It is not a de Polignac number, because 48535750753 - 21 = 48535750751 is a prime.

It is a super-3 number, since 3×485357507533 (a number of 33 digits) contains 333 as substring.

It is a Duffinian number.

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

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

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

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

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

Almost surely, 248535750753 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 63611847.

The product of its (nonzero) digits is 8820000, while the sum is 52.

The spelling of 48535750753 in words is "forty-eight billion, five hundred thirty-five million, seven hundred fifty thousand, seven hundred fifty-three".

Divisors: 1 7 109 763 63611731 445282117 6933678679 48535750753