Search a number
-
+
76901300993 = 116991027363
BaseRepresentation
bin100011110011110101…
…1001011101100000001
321100111101100212002002
41013213223023230001
52224443213112433
655154501433345
75361454162466
oct1074753135401
9240441325062
1076901300993
112a682863710
1212aa210b855
137337173cca
143a173dd66d
1520014309e8
hex11e7acbb01

76901300993 has 4 divisors (see below), whose sum is σ = 83892328368. Its totient is φ = 69910273620.

The previous prime is 76901300969. The next prime is 76901301011. The reversal of 76901300993 is 39900310967.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 76901300993 - 28 = 76901300737 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3495513671 + ... + 3495513692.

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

Almost surely, 276901300993 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6991027374.

The product of its (nonzero) digits is 275562, while the sum is 47.

The spelling of 76901300993 in words is "seventy-six billion, nine hundred one million, three hundred thousand, nine hundred ninety-three".

Divisors: 1 11 6991027363 76901300993