Search a number
-
+
115015638221 = 1116996154189
BaseRepresentation
bin110101100011101110…
…1110101110011001101
3101222212122012210112122
41223013131311303031
53341023000410341
6124500520142325
711211123536261
oct1530735656315
9358778183478
10115015638221
1144861369370
121a35a6079a5
13aacc672783
1457d13960a1
152ed25dc94b
hex1ac7775ccd

115015638221 has 8 divisors (see below), whose sum is σ = 125545476000. Its totient is φ = 104498112240.

The previous prime is 115015638131. The next prime is 115015638251. The reversal of 115015638221 is 122836510511.

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 115015638221 - 210 = 115015637197 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3058406 + ... + 3095783.

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

Almost surely, 2115015638221 is an apocalyptic number.

115015638221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 6155899.

The product of its (nonzero) digits is 14400, while the sum is 35.

The spelling of 115015638221 in words is "one hundred fifteen billion, fifteen million, six hundred thirty-eight thousand, two hundred twenty-one".

Divisors: 1 11 1699 18689 6154189 67696079 10455967111 115015638221