Search a number
-
+
30917506057 = 58763526139
BaseRepresentation
bin11100110010110100…
…111011010000001001
32221210200202001001221
4130302310323100021
51001304340143212
622111525242041
72143110315424
oct346264732011
987720661057
1030917506057
11121261429a9
125baa263321
132bb94aa9a9
1416d42409bb
15c0e462807
hex732d3b409

30917506057 has 4 divisors (see below), whose sum is σ = 30918090960. Its totient is φ = 30916921156.

The previous prime is 30917506051. The next prime is 30917506069. The reversal of 30917506057 is 75060571903.

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, and also an emirpimes, since its reverse is a distinct semiprime: 75060571903 = 174415327759.

It is a cyclic number.

It is not a de Polignac number, because 30917506057 - 219 = 30916981769 is a prime.

It is a Duffinian number.

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

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

Almost surely, 230917506057 is an apocalyptic number.

It is an amenable number.

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

30917506057 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 584902.

The product of its (nonzero) digits is 198450, while the sum is 43.

The spelling of 30917506057 in words is "thirty billion, nine hundred seventeen million, five hundred six thousand, fifty-seven".

Divisors: 1 58763 526139 30917506057