Search a number
-
+
115200415433531 = 1038747211278637
BaseRepresentation
bin11010001100011000101111…
…110101110000001100111011
3120002220001102000122210200202
4122030120233311300030323
5110044420422322333111
61045002201254352415
733156645454410341
oct3214305765601473
9502801360583622
10115200415433531
113378524927524a
1210b0674205b70b
134c3847776ac3c
142063a30a29991
15d4b961ab9b3b
hex68c62fd7033b

115200415433531 has 8 divisors (see below), whose sum is σ = 116319090018144. Its totient is φ = 114081745155840.

The previous prime is 115200415433527. The next prime is 115200415433561. The reversal of 115200415433531 is 135334514002511.

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 115200415433531 - 22 = 115200415433527 is a prime.

It is a super-2 number, since 2×1152004154335312 (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 (115200415433561) 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, 89456945 + ... + 90735581.

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

Almost surely, 2115200415433531 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2153461.

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

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

Divisors: 1 103 874721 1278637 90096263 131699611 1118450635277 115200415433531