Base | Representation |
---|---|
bin | 11111011101010010011… |
… | …10101110001100000000 |
3 | 10211022221002212220120110 |
4 | 33232221032232030000 |
5 | 120202113224000000 |
6 | 2144314135511320 |
7 | 141043054260336 |
oct | 17565116561400 |
9 | 3738832786513 |
10 | 1080876000000 |
11 | 387440361815 |
12 | 155593228540 |
13 | 7ac06a43044 |
14 | 3a459691b56 |
15 | 1d1b1ac0850 |
hex | fba93ae300 |
1080876000000 has 252 divisors, whose sum is σ = 3595876940936. Its totient is φ = 288230400000.
The previous prime is 1080875999999. The next prime is 1080876000011. The reversal of 1080876000000 is 6780801.
1080876000000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 11954964 + ... + 12045036.
Almost surely, 21080876000000 is an apocalyptic number.
1080876000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1080876000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1797938470468).
1080876000000 is an abundant number, since it is smaller than the sum of its proper divisors (2515000940936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1080876000000 is an frugal number, since it uses more digits than its factorization.
1080876000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90122 (or 90083 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 30.
The spelling of 1080876000000 in words is "one trillion, eighty billion, eight hundred seventy-six million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.213 sec. • engine limits •