Base | Representation |
---|---|
bin | 11000101101100111101000… |
… | …101000001110110100011101 |
3 | 112020211110212002200221202111 |
4 | 120231213220220032310131 |
5 | 103221221111333121403 |
6 | 1023054333452154021 |
7 | 31615311131116333 |
oct | 3055475050166435 |
9 | 466743762627674 |
10 | 108688050285853 |
11 | 316a4385992995 |
12 | 10234580168911 |
13 | 488531559aa5c |
14 | 1cba75b707b53 |
15 | c8735b6a156d |
hex | 62d9e8a0ed1d |
108688050285853 has 32 divisors (see below), whose sum is σ = 112015945923200. Its totient is φ = 105424582323456.
The previous prime is 108688050285851. The next prime is 108688050286003. The reversal of 108688050285853 is 358582050886801.
It is a cyclic number.
It is not a de Polignac number, because 108688050285853 - 21 = 108688050285851 is a prime.
It is a super-2 number, since 2×1086880502858532 (a number of 29 digits) contains 22 as substring.
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 (108688050285851) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 770826883 + ... + 770967871.
It is an arithmetic number, because the mean of its divisors is an integer number (3500498310100).
Almost surely, 2108688050285853 is an apocalyptic number.
It is an amenable number.
108688050285853 is a deficient number, since it is larger than the sum of its proper divisors (3327895637347).
108688050285853 is a wasteful number, since it uses less digits than its factorization.
108688050285853 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141821.
The product of its (nonzero) digits is 147456000, while the sum is 67.
The spelling of 108688050285853 in words is "one hundred eight trillion, six hundred eighty-eight billion, fifty million, two hundred eighty-five thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •