Base | Representation |
---|---|
bin | 11010001010111011100100… |
… | …001010111010111101111001 |
3 | 120002112111011002211210211202 |
4 | 122022323210022322331321 |
5 | 110041301020041311200 |
6 | 1044444213131103545 |
7 | 33146504155414412 |
oct | 3212734412727571 |
9 | 502474132753752 |
10 | 115100361666425 |
11 | 33746875556123 |
12 | 10aab27a2a1bb5 |
13 | 4c2bbc0a84555 |
14 | 205cc5c7b0809 |
15 | d49057cae1d5 |
hex | 68aee42baf79 |
115100361666425 has 6 divisors (see below), whose sum is σ = 142724448466398. Its totient is φ = 92080289333120.
The previous prime is 115100361666403. The next prime is 115100361666431. The reversal of 115100361666425 is 524666163001511.
It can be written as a sum of positive squares in 3 ways, for example, as 199370287081 + 114900991379344 = 446509^2 + 10719188^2 .
It is a de Polignac number, because none of the positive numbers 2k-115100361666425 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 115100361666425.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2302007233304 + ... + 2302007233353.
It is an arithmetic number, because the mean of its divisors is an integer number (23787408077733).
Almost surely, 2115100361666425 is an apocalyptic number.
It is an amenable number.
115100361666425 is a deficient number, since it is larger than the sum of its proper divisors (27624086799973).
115100361666425 is an equidigital number, since it uses as much as digits as its factorization.
115100361666425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4604014466667 (or 4604014466662 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 47.
The spelling of 115100361666425 in words is "one hundred fifteen trillion, one hundred billion, three hundred sixty-one million, six hundred sixty-six thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •