Base | Representation |
---|---|
bin | 11111110001011000110… |
… | …10110011010110111000 |
3 | 10212100210010220021120100 |
4 | 33320230122303112320 |
5 | 120341213212314132 |
6 | 2153301014355400 |
7 | 141604344455214 |
oct | 17705432632670 |
9 | 3770703807510 |
10 | 1091666916792 |
11 | 390a78573271 |
12 | 1576a505bb60 |
13 | 7bc36552bca |
14 | 3aba0897944 |
15 | 1d5e410e37c |
hex | fe2c6b35b8 |
1091666916792 has 48 divisors (see below), whose sum is σ = 3051972031680. Its totient is φ = 352150617600.
The previous prime is 1091666916787. The next prime is 1091666916803. The reversal of 1091666916792 is 2976196661901.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
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 11 ways as a sum of consecutive naturals, for example, 244546809 + ... + 244551272.
It is an arithmetic number, because the mean of its divisors is an integer number (63582750660).
Almost surely, 21091666916792 is an apocalyptic number.
1091666916792 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1091666916792 is an abundant number, since it is smaller than the sum of its proper divisors (1960305114888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1091666916792 is a wasteful number, since it uses less digits than its factorization.
1091666916792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489098124 (or 489098117 counting only the distinct ones).
The product of its (nonzero) digits is 13226976, while the sum is 63.
The spelling of 1091666916792 in words is "one trillion, ninety-one billion, six hundred sixty-six million, nine hundred sixteen thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •