Search a number
-
+
115010600050 = 2523386367927
BaseRepresentation
bin110101100011100101…
…0100111110001110010
3101222212021201211110201
41223013022213301302
53341020203200200
6124500220145414
711211032653603
oct1530712476162
9358767654421
10115010600050
1144859538095
121a35899826a
13aacb5ca4c8
1457d0843daa
152ed1e44c6a
hex1ac72a7c72

115010600050 has 24 divisors (see below), whose sum is σ = 213929182656. Its totient is φ = 46002204240.

The previous prime is 115010600041. The next prime is 115010600051. The reversal of 115010600050 is 50006010511.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1659187 + ... + 1727113.

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

Almost surely, 2115010600050 is an apocalyptic number.

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

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

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

115010600050 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 101802 (or 101797 counting only the distinct ones).

The product of its (nonzero) digits is 150, while the sum is 19.

Adding to 115010600050 its reverse (50006010511), we get a palindrome (165016610561).

The spelling of 115010600050 in words is "one hundred fifteen billion, ten million, six hundred thousand, fifty".

Divisors: 1 2 5 10 25 50 33863 67726 67927 135854 169315 338630 339635 679270 846575 1693150 1698175 3396350 2300212001 4600424002 11501060005 23002120010 57505300025 115010600050