Base | Representation |
---|---|
bin | 11111100111101000101… |
… | …00000101111110111000 |
3 | 10211212021012222012210000 |
4 | 33303310110011332320 |
5 | 120300002222313210 |
6 | 2151033243353000 |
7 | 141330523204002 |
oct | 17636424057670 |
9 | 3755235865700 |
10 | 1086430666680 |
11 | 389830874037 |
12 | 156683522760 |
13 | 7b5b0787268 |
14 | 3a825299372 |
15 | 1d3d958cac0 |
hex | fcf4505fb8 |
1086430666680 has 160 divisors (see below), whose sum is σ = 3697838020800. Its totient is φ = 286047500544.
The previous prime is 1086430666669. The next prime is 1086430666687. The reversal of 1086430666680 is 866660346801.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1086430666687) 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 39 ways as a sum of consecutive naturals, for example, 1866307 + ... + 2378226.
It is an arithmetic number, because the mean of its divisors is an integer number (23111487630).
Almost surely, 21086430666680 is an apocalyptic number.
1086430666680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1086430666680 is an abundant number, since it is smaller than the sum of its proper divisors (2611407354120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1086430666680 is a wasteful number, since it uses less digits than its factorization.
1086430666680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4244635 (or 4244622 counting only the distinct ones).
The product of its (nonzero) digits is 5971968, while the sum is 54.
The spelling of 1086430666680 in words is "one trillion, eighty-six billion, four hundred thirty million, six hundred sixty-six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •