Search a number
-
+
115521453254131 = 1367692211220833
BaseRepresentation
bin11010010001000011101111…
…001011110110010111110011
3120011000202001200221211220121
4122101003233023312113303
5110120200414013113011
61045405453433151111
733222102206020651
oct3221035713662763
9504022050854817
10115521453254131
11338994117a6541
1210b589b8b5b497
134c5c81ac941b2
1420753a7c07dd1
15d54ea1196e71
hex6910ef2f65f3

115521453254131 has 8 divisors (see below), whose sum is σ = 115607725330464. Its totient is φ = 115435183760640.

The previous prime is 115521453254069. The next prime is 115521453254143. The reversal of 115521453254131 is 131452354125511.

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 115521453254131 - 211 = 115521453252083 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2115521453254131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1291421.

The product of its digits is 360000, while the sum is 43.

The spelling of 115521453254131 in words is "one hundred fifteen trillion, five hundred twenty-one billion, four hundred fifty-three million, two hundred fifty-four thousand, one hundred thirty-one".

Divisors: 1 1367 69221 1220833 94625107 1668878711 84507281093 115521453254131