Search a number
-
+
113870602005567 = 3113450624303199
BaseRepresentation
bin11001111001000010010000…
…110010000110110000111111
3112221011220221001002021210220
4121321002100302012300333
5104411123443103134232
61042103233221432423
732661610445646621
oct3171022062066077
9487156831067726
10113870602005567
11333122842603a0
1210930a7626b713
134b6cc4ab43a84
14201951bb20c11
15d2708062142c
hex679090c86c3f

113870602005567 has 8 divisors (see below), whose sum is σ = 165629966553600. Its totient is φ = 69012486063960.

The previous prime is 113870602005539. The next prime is 113870602005571. The reversal of 113870602005567 is 765500206078311.

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

It is not a de Polignac number, because 113870602005567 - 216 = 113870601940031 is a prime.

It is a super-2 number, since 2×1138706020055672 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 2113870602005567 is an apocalyptic number.

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

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

113870602005567 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3450624303213.

The product of its (nonzero) digits is 2116800, while the sum is 51.

The spelling of 113870602005567 in words is "one hundred thirteen trillion, eight hundred seventy billion, six hundred two million, five thousand, five hundred sixty-seven".

Divisors: 1 3 11 33 3450624303199 10351872909597 37956867335189 113870602005567