Base | Representation |
---|---|
bin | 11000101100100000111101… |
… | …000001010011110101001101 |
3 | 112020120012221221121002201011 |
4 | 120230200331001103311031 |
5 | 103214000144111003142 |
6 | 1022555422550045221 |
7 | 31606653331433152 |
oct | 3054407501236515 |
9 | 466505857532634 |
10 | 108612156734797 |
11 | 3167517aa66771 |
12 | 1022191b649811 |
13 | 487b10c1485b1 |
14 | 1cb6bdc0b2229 |
15 | c853b8983417 |
hex | 62c83d053d4d |
108612156734797 has 16 divisors (see below), whose sum is σ = 113793007820800. Its totient is φ = 103536239249520.
The previous prime is 108612156734791. The next prime is 108612156734819. The reversal of 108612156734797 is 797437651216801.
It is a cyclic number.
It is not a de Polignac number, because 108612156734797 - 235 = 108577796996429 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (67).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108612156734791) 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, 61352104 + ... + 63097582.
It is an arithmetic number, because the mean of its divisors is an integer number (7112062988800).
It is a 1-persistent number, because it is pandigital, but 2⋅108612156734797 = 217224313469594 is not.
Almost surely, 2108612156734797 is an apocalyptic number.
It is an amenable number.
108612156734797 is a deficient number, since it is larger than the sum of its proper divisors (5180851086003).
108612156734797 is a wasteful number, since it uses less digits than its factorization.
108612156734797 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1775536.
The product of its (nonzero) digits is 106686720, while the sum is 67.
The spelling of 108612156734797 in words is "one hundred eight trillion, six hundred twelve billion, one hundred fifty-six million, seven hundred thirty-four thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •