Search a number
-
+
115660022313 = 3112378611423
BaseRepresentation
bin110101110110111011…
…1111110001000101001
3102001112112201220100010
41223231313332020221
53343332431203223
6125044455402133
711233106653143
oct1535567761051
9361475656303
10115660022313
1145062081700
121a4ba383349
13aba300b534
145852bb3c93
15301de76393
hex1aeddfe229

115660022313 has 24 divisors (see below), whose sum is σ = 174088547584. Its totient is φ = 68202462240.

The previous prime is 115660022293. The next prime is 115660022347. The reversal of 115660022313 is 313220066511.

It is not a de Polignac number, because 115660022313 - 25 = 115660022281 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (115660022383) 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 23 ways as a sum of consecutive naturals, for example, 4292281 + ... + 4319142.

Almost surely, 2115660022313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 6480, while the sum is 30.

Adding to 115660022313 its reverse (313220066511), we get a palindrome (428880088824).

The spelling of 115660022313 in words is "one hundred fifteen billion, six hundred sixty million, twenty-two thousand, three hundred thirteen".

Divisors: 1 3 11 33 37 111 121 363 407 1221 4477 13431 8611423 25834269 94725653 284176959 318622651 955867953 1041982183 3125946549 3504849161 10514547483 38553340771 115660022313