Search a number
-
+
115021614325331 = 737444098897009
BaseRepresentation
bin11010001001110010001110…
…011101101001111001010011
3120002020221220001211101211002
4122021302032131221321103
5110034003231231402311
61044344111122212215
733141015554151530
oct3211621635517123
9502227801741732
10115021614325331
113371643575223a
1210a97b61ab406b
134c2465132062c
14205910c151d87
15d46e9977d93b
hex689c8e769e53

115021614325331 has 8 divisors (see below), whose sum is σ = 135006064691040. Its totient is φ = 95925361753728.

The previous prime is 115021614325283. The next prime is 115021614325357. The reversal of 115021614325331 is 133523416120511.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-115021614325331 is a prime.

It is a super-2 number, since 2×1150216143253312 (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 (115021614325391) 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, 222049448246 + ... + 222049448763.

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

Almost surely, 2115021614325331 is an apocalyptic number.

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

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

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

The sum of its prime factors is 444098897053.

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

The spelling of 115021614325331 in words is "one hundred fifteen trillion, twenty-one billion, six hundred fourteen million, three hundred twenty-five thousand, three hundred thirty-one".

Divisors: 1 7 37 259 444098897009 3108692279063 16431659189333 115021614325331