Base | Representation |
---|---|
bin | 11000000001100111010011… |
… | …101000110010011111101101 |
3 | 111212010101100200222101201020 |
4 | 120001213103220302133231 |
5 | 102322144424012242221 |
6 | 1012421220153204353 |
7 | 31153655304334164 |
oct | 3001472350623755 |
9 | 455111320871636 |
10 | 105664041134061 |
11 | 30738960623103 |
12 | ba264957006b9 |
13 | 46c60cb8b9077 |
14 | 1c14249cb23db |
15 | c3386e25eac6 |
hex | 6019d3a327ed |
105664041134061 has 16 divisors (see below), whose sum is σ = 142183319040000. Its totient is φ = 69795759851568.
The previous prime is 105664041134051. The next prime is 105664041134111. The reversal of 105664041134061 is 160431140466501.
105664041134061 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 105664041134061 - 215 = 105664041101293 is a prime.
It is a super-2 number, since 2×1056640411340612 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105664041134051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 253690701 + ... + 254106866.
It is an arithmetic number, because the mean of its divisors is an integer number (8886457440000).
Almost surely, 2105664041134061 is an apocalyptic number.
It is an amenable number.
105664041134061 is a deficient number, since it is larger than the sum of its proper divisors (36519277905939).
105664041134061 is a wasteful number, since it uses less digits than its factorization.
105664041134061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 507798208.
The product of its (nonzero) digits is 207360, while the sum is 42.
The spelling of 105664041134061 in words is "one hundred five trillion, six hundred sixty-four billion, forty-one million, one hundred thirty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •