Search a number
-
+
115600026566343 = 3112318457373461
BaseRepresentation
bin11010010010001100111010…
…100001001111111011000111
3120011022020212121111200012010
4122102030322201033323013
5110122442323300110333
61045505530304025303
733230553265114644
oct3222147241177307
9504266777450163
10115600026566343
1133919772345a00
1210b70087002233
134c67060665047
1420790dd2c4dcb
15d5704e29d563
hex69233a84fec7

115600026566343 has 12 divisors (see below), whose sum is σ = 169419322681784. Its totient is φ = 70060622161200.

The previous prime is 115600026566251. The next prime is 115600026566371. The reversal of 115600026566343 is 343665620006511.

It is not a de Polignac number, because 115600026566343 - 29 = 115600026565831 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 159228686368 + ... + 159228687093.

Almost surely, 2115600026566343 is an apocalyptic number.

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

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

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

The sum of its prime factors is 318457373486 (or 318457373475 counting only the distinct ones).

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

The spelling of 115600026566343 in words is "one hundred fifteen trillion, six hundred billion, twenty-six million, five hundred sixty-six thousand, three hundred forty-three".

Divisors: 1 3 11 33 121 363 318457373461 955372120383 3503031108071 10509093324213 38533342188781 115600026566343