Search a number
-
+
48514261765701 = 3102531577237939
BaseRepresentation
bin10110000011111100110110…
…10101101100111001000101
320100202220210022112220000210
423001332123111230321011
522324324202003000301
6251103051050430033
713135016426665314
oct1301763325547105
9210686708486023
1048514261765701
1114504868003426
125536480132319
13210bb4bc1a3b4
14bda16211427b
15591e798a3ad6
hex2c1f9b56ce45

48514261765701 has 8 divisors (see below), whose sum is σ = 64691991347040. Its totient is φ = 32339686680752.

The previous prime is 48514261765699. The next prime is 48514261765763. The reversal of 48514261765701 is 10756716241584.

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

It is a cyclic number.

It is not a de Polignac number, because 48514261765701 - 21 = 48514261765699 is a prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 248514261765701 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1577248195.

The product of its (nonzero) digits is 11289600, while the sum is 57.

The spelling of 48514261765701 in words is "forty-eight trillion, five hundred fourteen billion, two hundred sixty-one million, seven hundred sixty-five thousand, seven hundred one".

Divisors: 1 3 10253 30759 1577237939 4731713817 16171420588567 48514261765701