Search a number
-
+
116252050570010 = 2511625205057001
BaseRepresentation
bin11010011011101100001010…
…001011011011101100011010
3120020121120212021200221100222
4122123230022023123230122
5110214133144421220020
61051125242121200042
733325635120523025
oct3233541213335432
9506546767627328
10116252050570010
1134050243953453
1211056514630022
134cb36a1492174
14209c8b4a021bc
15d68eb1515b25
hex69bb0a2dbb1a

116252050570010 has 8 divisors (see below), whose sum is σ = 209253691026036. Its totient is φ = 46500820228000.

The previous prime is 116252050569971. The next prime is 116252050570013. The reversal of 116252050570010 is 10075050252611.

It can be written as a sum of positive squares in 2 ways, for example, as 111684251477929 + 4567799092081 = 10568077^2 + 2137241^2 .

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

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

It is a Curzon number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5812602528491 + ... + 5812602528510.

Almost surely, 2116252050570010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 11625205057008.

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

The spelling of 116252050570010 in words is "one hundred sixteen trillion, two hundred fifty-two billion, fifty million, five hundred seventy thousand, ten".

Divisors: 1 2 5 10 11625205057001 23250410114002 58126025285005 116252050570010