Base | Representation |
---|---|
bin | 110010010100111101… |
… | …1101100011010011000 |
3 | 101022222010020211221020 |
4 | 1210221323230122120 |
5 | 3232320342243124 |
6 | 121352240042440 |
7 | 10544160156360 |
oct | 1445173543230 |
9 | 338863224836 |
10 | 108077696664 |
11 | 41921051173 |
12 | 18b43003420 |
13 | a265187702 |
14 | 5333b919a0 |
15 | 2c28481379 |
hex | 1929eec698 |
108077696664 has 32 divisors (see below), whose sum is σ = 308793419520. Its totient is φ = 30879341856.
The previous prime is 108077696593. The next prime is 108077696669. The reversal of 108077696664 is 466696770801.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 108077696598 and 108077696607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108077696669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 321659644 + ... + 321659979.
It is an arithmetic number, because the mean of its divisors is an integer number (9649794360).
Almost surely, 2108077696664 is an apocalyptic number.
108077696664 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
108077696664 is an abundant number, since it is smaller than the sum of its proper divisors (200715722856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108077696664 is a wasteful number, since it uses less digits than its factorization.
108077696664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 643319639 (or 643319635 counting only the distinct ones).
The product of its (nonzero) digits is 18289152, while the sum is 60.
The spelling of 108077696664 in words is "one hundred eight billion, seventy-seven million, six hundred ninety-six thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •