Base | Representation |
---|---|
bin | 11000100010011000101001… |
… | …111111011001010111011101 |
3 | 112011002200012021011111110202 |
4 | 120202120221333121113131 |
5 | 103121044034001423000 |
6 | 1021303541130113245 |
7 | 31505451250342544 |
oct | 3042305177312735 |
9 | 464080167144422 |
10 | 107916052764125 |
11 | 31426a39468621 |
12 | 1012aa2b87b825 |
13 | 482a594bc9168 |
14 | 1c912443b915b |
15 | c72226964dd5 |
hex | 622629fd95dd |
107916052764125 has 16 divisors (see below), whose sum is σ = 134679682086768. Its totient is φ = 86332554880000.
The previous prime is 107916052764109. The next prime is 107916052764199. The reversal of 107916052764125 is 521467250619701.
It can be written as a sum of positive squares in 8 ways, for example, as 1805575376089 + 106110477388036 = 1343717^2 + 10300994^2 .
It is not a de Polignac number, because 107916052764125 - 24 = 107916052764109 is a prime.
It is a super-2 number, since 2×1079160527641252 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41347925 + ... + 43880325.
It is an arithmetic number, because the mean of its divisors is an integer number (8417480130423).
Almost surely, 2107916052764125 is an apocalyptic number.
It is an amenable number.
107916052764125 is a deficient number, since it is larger than the sum of its proper divisors (26763629322643).
107916052764125 is an equidigital number, since it uses as much as digits as its factorization.
107916052764125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2873329 (or 2873319 counting only the distinct ones).
The product of its (nonzero) digits is 6350400, while the sum is 56.
The spelling of 107916052764125 in words is "one hundred seven trillion, nine hundred sixteen billion, fifty-two million, seven hundred sixty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •