Search a number
-
+
115156516051565 = 5471063460985633
BaseRepresentation
bin11010001011101111110111…
…001110111001101001101101
3120002201212002121020010201222
4122023233313032321221231
5110043211021102122230
61044530101222313125
733153532551001112
oct3213576716715155
9502655077203658
10115156516051565
113376867120688a
1210aba1302887a5
134c3429c895b91
14206186861a909
15d4a742ad56e5
hex68bbf73b9a6d

115156516051565 has 16 divisors (see below), whose sum is σ = 141260749797888. Its totient is φ = 90080280377856.

The previous prime is 115156516051553. The next prime is 115156516051579. The reversal of 115156516051565 is 565150615651511.

It is a happy number.

It is a cyclic number.

It is not a de Polignac number, because 115156516051565 - 214 = 115156516035181 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 230243012 + ... + 230742621.

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

Almost surely, 2115156516051565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 460986748.

The product of its (nonzero) digits is 3375000, while the sum is 53.

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

Divisors: 1 5 47 235 1063 5315 49961 249805 460985633 2304928165 21666324751 108331623755 490027727879 2450138639395 23031303210313 115156516051565