Search a number
-
+
115451031981 = 338483677327
BaseRepresentation
bin110101110000101101…
…0101111000110101101
3102000222222111002111110
41223201122233012231
53342420431010411
6125012032142233
711224661402655
oct1534132570655
9360888432443
10115451031981
1144a6510911a
121a460397979
13ab6b92710c
145833131365
15300a9432a6
hex1ae16af1ad

115451031981 has 4 divisors (see below), whose sum is σ = 153934709312. Its totient is φ = 76967354652.

The previous prime is 115451031961. The next prime is 115451032087. The reversal of 115451031981 is 189130154511.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 189130154511 = 363043384837.

It is not a de Polignac number, because 115451031981 - 27 = 115451031853 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19241838661 + ... + 19241838666.

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

Almost surely, 2115451031981 is an apocalyptic number.

It is an amenable number.

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

115451031981 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 38483677330.

The product of its (nonzero) digits is 21600, while the sum is 39.

The spelling of 115451031981 in words is "one hundred fifteen billion, four hundred fifty-one million, thirty-one thousand, nine hundred eighty-one".

Divisors: 1 3 38483677327 115451031981