Search a number
-
+
117015067001 = 716716438143
BaseRepresentation
bin110110011111010100…
…1000011100101111001
3102012000222111022012102
41230332221003211321
53404121324121001
6125431142553145
711311512441560
oct1547651034571
9365028438172
10117015067001
1145697a55848
121a8181387b5
13b05a979b21
145940b42bd7
15309cddae6b
hex1b3ea43979

117015067001 has 4 divisors (see below), whose sum is σ = 133731505152. Its totient is φ = 100298628852.

The previous prime is 117015066989. The next prime is 117015067067. The reversal of 117015067001 is 100760510711.

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 a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-117015067001 is a prime.

It is a Curzon number.

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

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

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

Almost surely, 2117015067001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 16716438150.

The product of its (nonzero) digits is 1470, while the sum is 29.

Adding to 117015067001 its reverse (100760510711), we get a palindrome (217775577712).

The spelling of 117015067001 in words is "one hundred seventeen billion, fifteen million, sixty-seven thousand, one".

Divisors: 1 7 16716438143 117015067001