Base | Representation |
---|---|
bin | 110001101100111101… |
… | …1110000001001011001 |
3 | 101012111120201221211011 |
4 | 1203121323300021121 |
5 | 3222043244102211 |
6 | 121011132533521 |
7 | 10466002034566 |
oct | 1433173601131 |
9 | 335446657734 |
10 | 106735534681 |
11 | 412a2476a96 |
12 | 188296212a1 |
13 | a0b00a9b19 |
14 | 524781786d |
15 | 2b9a713921 |
hex | 18d9ef0259 |
106735534681 has 32 divisors (see below), whose sum is σ = 112367923200. Its totient is φ = 101299904640.
The previous prime is 106735534673. The next prime is 106735534751. The reversal of 106735534681 is 186435537601.
It is not a de Polignac number, because 106735534681 - 23 = 106735534673 is a prime.
It is a super-2 number, since 2×1067355346812 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106735534601) 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 31 ways as a sum of consecutive naturals, for example, 94539325 + ... + 94540453.
It is an arithmetic number, because the mean of its divisors is an integer number (3511497600).
Almost surely, 2106735534681 is an apocalyptic number.
It is an amenable number.
106735534681 is a deficient number, since it is larger than the sum of its proper divisors (5632388519).
106735534681 is a wasteful number, since it uses less digits than its factorization.
106735534681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1669.
The product of its (nonzero) digits is 1814400, while the sum is 49.
The spelling of 106735534681 in words is "one hundred six billion, seven hundred thirty-five million, five hundred thirty-four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •