Search a number
-
+
115101551501050 = 25222910052537249
BaseRepresentation
bin11010001010111100101011…
…000101110001111011111010
3120002112121020000201200002211
4122022330223011301323322
5110041310434141013200
61044444531153245334
733146545514014132
oct3212745305617372
9502477200650084
10115101551501050
1133747326149524
1210aab55086384a
134c2c050429aca
14205cd32815ac2
15d490c748caba
hex68af2b171efa

115101551501050 has 24 divisors (see below), whose sum is σ = 215023771777500. Its totient is φ = 45839569850880.

The previous prime is 115101551501047. The next prime is 115101551501087. The reversal of 115101551501050 is 50105155101511.

It can be written as a sum of positive squares in 6 ways, for example, as 48683566524321 + 66417984976729 = 6977361^2 + 8149723^2 .

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

It is an unprimeable number.

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

Almost surely, 2115101551501050 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 3125, while the sum is 31.

The spelling of 115101551501050 in words is "one hundred fifteen trillion, one hundred one billion, five hundred fifty-one million, five hundred one thousand, fifty".

Divisors: 1 2 5 10 25 50 229 458 1145 2290 5725 11450 10052537249 20105074498 50262686245 100525372490 251313431225 502626862450 2302031030021 4604062060042 11510155150105 23020310300210 57550775750525 115101551501050