Base | Representation |
---|---|
bin | 10111011100011010110111… |
… | …011010000000111010100101 |
3 | 111112002000221010020001000001 |
4 | 113130122313122000322211 |
5 | 102003310302330122142 |
6 | 1003143104553021301 |
7 | 30501211615655101 |
oct | 2734326732007245 |
9 | 445060833201001 |
10 | 103108061957797 |
11 | 2a942979a54196 |
12 | b6930493b4831 |
13 | 456c0827ac7c0 |
14 | 1b66657760901 |
15 | bdc125dd65b7 |
hex | 5dc6b7680ea5 |
103108061957797 has 16 divisors (see below), whose sum is σ = 111061169816688. Its totient is φ = 95158058688000.
The previous prime is 103108061957731. The next prime is 103108061957861. The reversal of 103108061957797 is 797759160801301.
It is a happy number.
It is a Cunningham number, because it is equal to 101542142+1.
It can be written as a sum of positive squares in 8 ways, for example, as 52009568838756 + 51098493119041 = 7211766^2 + 7148321^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103108061957797 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103108061957497) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1838134683 + ... + 1838190775.
It is an arithmetic number, because the mean of its divisors is an integer number (6941323113543).
Almost surely, 2103108061957797 is an apocalyptic number.
It is an amenable number.
103108061957797 is a deficient number, since it is larger than the sum of its proper divisors (7953107858891).
103108061957797 is a wasteful number, since it uses less digits than its factorization.
103108061957797 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81240.
The product of its (nonzero) digits is 20003760, while the sum is 64.
The spelling of 103108061957797 in words is "one hundred three trillion, one hundred eight billion, sixty-one million, nine hundred fifty-seven thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •