Base | Representation |
---|---|
bin | 110001110111010010… |
… | …0111000011001001011 |
3 | 101020101201102010210010 |
4 | 1203232210320121023 |
5 | 3223300424020213 |
6 | 121105343523003 |
7 | 10510405540440 |
oct | 1435644703113 |
9 | 336351363703 |
10 | 107081860683 |
11 | 4145aa11926 |
12 | 189055b9463 |
13 | a136a77955 |
14 | 527b8099c7 |
15 | 2bbad23ac3 |
hex | 18ee93864b |
107081860683 has 8 divisors (see below), whose sum is σ = 163172359168. Its totient is φ = 61189634664.
The previous prime is 107081860663. The next prime is 107081860703. The reversal of 107081860683 is 386068180701.
It is an interprime number because it is at equal distance from previous prime (107081860663) and next prime (107081860703).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107081860683 - 212 = 107081856587 is a prime.
It is a super-2 number, since 2×1070818606832 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (107081860603) 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, 2549568091 + ... + 2549568132.
It is an arithmetic number, because the mean of its divisors is an integer number (20396544896).
Almost surely, 2107081860683 is an apocalyptic number.
107081860683 is a deficient number, since it is larger than the sum of its proper divisors (56090498485).
107081860683 is an equidigital number, since it uses as much as digits as its factorization.
107081860683 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5099136233.
The product of its (nonzero) digits is 387072, while the sum is 48.
The spelling of 107081860683 in words is "one hundred seven billion, eighty-one million, eight hundred sixty thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •