Search a number
-
+
116251606666051 = 330135217087751
BaseRepresentation
bin11010011011101011101111…
…101110000100101101000011
3120020121112201100102021121121
4122123223233232010231003
5110214131242301303201
61051125130102533111
733325621120433263
oct3233535756045503
9506545640367547
10116251606666051
113405003632087a
121105640ba37197
134cb363051b0bc
14209c871a8d7a3
15d68e8757d9a1
hex69baefb84b43

116251606666051 has 4 divisors (see below), whose sum is σ = 116286823757104. Its totient is φ = 116216389575000.

The previous prime is 116251606666043. The next prime is 116251606666123. The reversal of 116251606666051 is 150666606152611.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 116251606666051 - 23 = 116251606666043 is a prime.

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 116251606666051.

It is not an unprimeable number, because it can be changed into a prime (116251606636051) 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, 17608540575 + ... + 17608547176.

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

Almost surely, 2116251606666051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 35217091052.

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

The spelling of 116251606666051 in words is "one hundred sixteen trillion, two hundred fifty-one billion, six hundred six million, six hundred sixty-six thousand, fifty-one".

Divisors: 1 3301 35217087751 116251606666051