Base | Representation |
---|---|
bin | 11111010101101111111… |
… | …11011010101110110010 |
3 | 10210221111001010201001000 |
4 | 33222313333122232302 |
5 | 120120321120212330 |
6 | 2142404355422430 |
7 | 140540550515043 |
oct | 17526777325662 |
9 | 3727431121030 |
10 | 1076828679090 |
11 | 3857537976aa |
12 | 1548438b4a16 |
13 | 7a7103937b8 |
14 | 3a193d408ca |
15 | 1d0265ee560 |
hex | fab7fdabb2 |
1076828679090 has 96 divisors (see below), whose sum is σ = 2900263178880. Its totient is φ = 284310475200.
The previous prime is 1076828679071. The next prime is 1076828679131. The reversal of 1076828679090 is 909768286701.
It is a super-2 number, since 2×10768286790902 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2558787 + ... + 2949753.
It is an arithmetic number, because the mean of its divisors is an integer number (30211074780).
Almost surely, 21076828679090 is an apocalyptic number.
1076828679090 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1076828679090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1450131589440).
1076828679090 is an abundant number, since it is smaller than the sum of its proper divisors (1823434499790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1076828679090 is a wasteful number, since it uses less digits than its factorization.
1076828679090 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 391185 (or 391078 counting only the distinct ones).
The product of its (nonzero) digits is 18289152, while the sum is 63.
The spelling of 1076828679090 in words is "one trillion, seventy-six billion, eight hundred twenty-eight million, six hundred seventy-nine thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •