Base | Representation |
---|---|
bin | 110001101001111110… |
… | …1011110101100110101 |
3 | 101012020121011201220100 |
4 | 1203103331132230311 |
5 | 3221342120333323 |
6 | 120553153024313 |
7 | 10463344205025 |
oct | 1432375365465 |
9 | 335217151810 |
10 | 106635324213 |
11 | 41250951420 |
12 | 187bbb55099 |
13 | a0953c15a2 |
14 | 52383ada85 |
15 | 2b91a1b943 |
hex | 18d3f5eb35 |
106635324213 has 12 divisors (see below), whose sum is σ = 168031420128. Its totient is φ = 64627469160.
The previous prime is 106635324199. The next prime is 106635324251. The reversal of 106635324213 is 312423536601.
106635324213 is a `hidden beast` number, since 1 + 0 + 6 + 635 + 3 + 2 + 4 + 2 + 13 = 666.
It is not a de Polignac number, because 106635324213 - 25 = 106635324181 is a prime.
It is a super-2 number, since 2×1066353242132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106635324613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 538562145 + ... + 538562342.
It is an arithmetic number, because the mean of its divisors is an integer number (14002618344).
Almost surely, 2106635324213 is an apocalyptic number.
It is an amenable number.
106635324213 is a deficient number, since it is larger than the sum of its proper divisors (61396095915).
106635324213 is a wasteful number, since it uses less digits than its factorization.
106635324213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1077124504 (or 1077124501 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
The spelling of 106635324213 in words is "one hundred six billion, six hundred thirty-five million, three hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •