Base | Representation |
---|---|
bin | 11000000100110111111111… |
… | …010110010111110100011111 |
3 | 111212220210201122100120100111 |
4 | 120010313333112113310133 |
5 | 102334332323334144403 |
6 | 1013112154422510451 |
7 | 31206110101156261 |
oct | 3004677726276437 |
9 | 455823648316314 |
10 | 105888112803103 |
11 | 308149951a8564 |
12 | ba619aa895427 |
13 | 471128b008997 |
14 | 1c21024d27b31 |
15 | c395d5b3056d |
hex | 604dff597d1f |
105888112803103 has 16 divisors (see below), whose sum is σ = 107089403904000. Its totient is φ = 104693595739200.
The previous prime is 105888112803091. The next prime is 105888112803149. The reversal of 105888112803103 is 301308211888501.
It is a cyclic number.
It is not a de Polignac number, because 105888112803103 - 213 = 105888112794911 is a prime.
It is a super-2 number, since 2×1058881128031032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105888112801103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 164305698 + ... + 164948896.
It is an arithmetic number, because the mean of its divisors is an integer number (6693087744000).
Almost surely, 2105888112803103 is an apocalyptic number.
105888112803103 is a deficient number, since it is larger than the sum of its proper divisors (1201291100897).
105888112803103 is a wasteful number, since it uses less digits than its factorization.
105888112803103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648462.
The product of its (nonzero) digits is 368640, while the sum is 49.
The spelling of 105888112803103 in words is "one hundred five trillion, eight hundred eighty-eight billion, one hundred twelve million, eight hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.300 sec. • engine limits •