Search a number
-
+
116105666615067 = 3311248448028119
BaseRepresentation
bin11010011001100011110101…
…000000111101011100011011
3120020002121000112110112210010
4122121203311000331130123
5110204233401123140232
61050534112405053003
733312233440451133
oct3231436500753433
9506077015415703
10116105666615067
1133aa4155a32498
12110320809b7163
134ca294312004c
1420957895b9ac3
15d652951170cc
hex6998f503d71b

116105666615067 has 8 divisors (see below), whose sum is σ = 159801347599360. Its totient is φ = 74906881687080.

The previous prime is 116105666615063. The next prime is 116105666615069. The reversal of 116105666615067 is 760516666501611.

It is a happy number.

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

It is not a de Polignac number, because 116105666615067 - 22 = 116105666615063 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 116105666614998 and 116105666615016.

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

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

Almost surely, 2116105666615067 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1248448028153.

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

The spelling of 116105666615067 in words is "one hundred sixteen trillion, one hundred five billion, six hundred sixty-six million, six hundred fifteen thousand, sixty-seven".

Divisors: 1 3 31 93 1248448028119 3745344084357 38701888871689 116105666615067