Base | Representation |
---|---|
bin | 10000000110011001010… |
… | …100111111001111111110 |
3 | 10220202202110022002212000 |
4 | 100012121110333033332 |
5 | 121111331011323240 |
6 | 2204132525523130 |
7 | 142635050266314 |
oct | 20063124771776 |
9 | 3822673262760 |
10 | 1106379011070 |
11 | 397238121473 |
12 | 15a5101134a6 |
13 | 8043c547038 |
14 | 3b7987760b4 |
15 | 1dba5a03430 |
hex | 1019953f3fe |
1106379011070 has 64 divisors (see below), whose sum is σ = 2966826528000. Its totient is φ = 293386153248.
The previous prime is 1106379011063. The next prime is 1106379011119. The reversal of 1106379011070 is 701109736011.
1106379011070 is a `hidden beast` number, since 1 + 1 + 0 + 637 + 9 + 0 + 1 + 10 + 7 + 0 = 666.
It is a super-2 number, since 2×11063790110702 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 11397760 + ... + 11494419.
It is an arithmetic number, because the mean of its divisors is an integer number (46356664500).
Almost surely, 21106379011070 is an apocalyptic number.
1106379011070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1106379011070 is an abundant number, since it is smaller than the sum of its proper divisors (1860447516930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1106379011070 is a wasteful number, since it uses less digits than its factorization.
1106379011070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22892374 (or 22892368 counting only the distinct ones).
The product of its (nonzero) digits is 7938, while the sum is 36.
The spelling of 1106379011070 in words is "one trillion, one hundred six billion, three hundred seventy-nine million, eleven thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •