Search a number
-
+
115031153553131 = 3089110473370957
BaseRepresentation
bin11010001001111011000111…
…000010111010111011101011
3120002021212111212120101022102
4122021323013002322323223
5110034132300302200011
61044352325445044015
733141504135230354
oct3211730702727353
9502255455511272
10115031153553131
113371a490363282
1210a999846b660b
134c2551170bc1a
142059775010d2b
15d47356e7173b
hex689ec70baeeb

115031153553131 has 8 divisors (see below), whose sum is σ = 115078842910560. Its totient is φ = 114983470965888.

The previous prime is 115031153553119. The next prime is 115031153553139. The reversal of 115031153553131 is 131355351130511.

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 115031153553131 - 26 = 115031153553067 is a prime.

It is a super-2 number, since 2×1150311535531312 (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 (115031153553139) 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, 32438705 + ... + 35809661.

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

Almost surely, 2115031153553131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3385093.

The product of its (nonzero) digits is 50625, while the sum is 38.

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

Divisors: 1 3089 11047 3370957 34124183 10412886173 37238961979 115031153553131