Base | Representation |
---|---|
bin | 11000011111011111000111… |
… | …000111110100010100000101 |
3 | 112010101121221202222110201220 |
4 | 120133133013013310110011 |
5 | 103104313024314003103 |
6 | 1021032232043110553 |
7 | 31455166231661232 |
oct | 3037370707642405 |
9 | 463347852873656 |
10 | 107716825531653 |
11 | 3135a4a3928078 |
12 | 100b82aab12459 |
13 | 4814864a167a0 |
14 | 1c85744bb4789 |
15 | c6be66288c53 |
hex | 61f7c71f4505 |
107716825531653 has 16 divisors (see below), whose sum is σ = 154671251466816. Its totient is φ = 66286875300480.
The previous prime is 107716825531603. The next prime is 107716825531691. The reversal of 107716825531653 is 356135528617701.
It is a de Polignac number, because none of the positive numbers 2k-107716825531653 is a prime.
It is a super-2 number, since 2×1077168255316532 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107716825531603) 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, 1794400 + ... + 14786937.
It is an arithmetic number, because the mean of its divisors is an integer number (9666953216676).
Almost surely, 2107716825531653 is an apocalyptic number.
107716825531653 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
107716825531653 is a deficient number, since it is larger than the sum of its proper divisors (46954425935163).
107716825531653 is a wasteful number, since it uses less digits than its factorization.
107716825531653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16747924.
The product of its (nonzero) digits is 31752000, while the sum is 60.
The spelling of 107716825531653 in words is "one hundred seven trillion, seven hundred sixteen billion, eight hundred twenty-five million, five hundred thirty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •