Base | Representation |
---|---|
bin | 110001001100010110… |
… | …0011110010110110100 |
3 | 101002200022012101001200 |
4 | 1202120230132112310 |
5 | 3212323044314422 |
6 | 120310353252500 |
7 | 10426611526404 |
oct | 1423054362664 |
9 | 332608171050 |
10 | 105641010612 |
11 | 40890661945 |
12 | 18582b64130 |
13 | 9c673c5747 |
14 | 5182302804 |
15 | 2b345b02ac |
hex | 1898b1e5b4 |
105641010612 has 36 divisors (see below), whose sum is σ = 268076076996. Its totient is φ = 35076648960.
The previous prime is 105641010473. The next prime is 105641010641. The reversal of 105641010612 is 216010146501.
105641010612 is a `hidden beast` number, since 1 + 0 + 5 + 6 + 41 + 0 + 1 + 0 + 612 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 104331584016 + 1309426596 = 323004^2 + 36186^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×1056410106122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5699839 + ... + 5718342.
Almost surely, 2105641010612 is an apocalyptic number.
105641010612 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105641010612 is an abundant number, since it is smaller than the sum of its proper divisors (162435066384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105641010612 is a wasteful number, since it uses less digits than its factorization.
105641010612 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11418448 (or 11418443 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The spelling of 105641010612 in words is "one hundred five billion, six hundred forty-one million, ten thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •