Search a number
-
+
116424601213 = 7431549101159
BaseRepresentation
bin110110001101101110…
…0100110111001111101
3102010111211102112102011
41230123130212321331
53401414144214323
6125252411131221
711261052532144
oct1543334467175
9363454375364
10116424601213
114541471a098
121a692443b11
13ac9553ba9b
1458c655c75b
15306615320d
hex1b1b726e7d

116424601213 has 8 divisors (see below), whose sum is σ = 116657712000. Its totient is φ = 116191697328.

The previous prime is 116424601211. The next prime is 116424601231. The reversal of 116424601213 is 312106424611.

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

It is a cyclic number.

It is not a de Polignac number, because 116424601213 - 21 = 116424601211 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1100328 + ... + 1201486.

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

Almost surely, 2116424601213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 103451.

The product of its (nonzero) digits is 6912, while the sum is 31.

The spelling of 116424601213 in words is "one hundred sixteen billion, four hundred twenty-four million, six hundred one thousand, two hundred thirteen".

Divisors: 1 743 1549 101159 1150907 75161137 156695291 116424601213