Base | Representation |
---|---|
bin | 10000011101000111011… |
… | …111001110100111100000 |
3 | 11000002201201002202002020 |
4 | 100131013133032213200 |
5 | 122011312044030040 |
6 | 2223245441021440 |
7 | 144460451302200 |
oct | 20350737164740 |
9 | 4002651082066 |
10 | 1130775767520 |
11 | 3a6617494703 |
12 | 16319a624880 |
13 | 82829aba4b9 |
14 | 3ca30970400 |
15 | 1e632766cd0 |
hex | 107477ce9e0 |
1130775767520 has 576 divisors, whose sum is σ = 4443950407680. Its totient is φ = 240234688512.
The previous prime is 1130775767509. The next prime is 1130775767533. The reversal of 1130775767520 is 257675770311.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 23660769 + ... + 23708511.
It is an arithmetic number, because the mean of its divisors is an integer number (7715191680).
Almost surely, 21130775767520 is an apocalyptic number.
1130775767520 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 1130775767520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2221975203840).
1130775767520 is an abundant number, since it is smaller than the sum of its proper divisors (3313174640160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130775767520 is a wasteful number, since it uses less digits than its factorization.
1130775767520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47847 (or 47832 counting only the distinct ones).
The product of its (nonzero) digits is 2160900, while the sum is 51.
The spelling of 1130775767520 in words is "one trillion, one hundred thirty billion, seven hundred seventy-five million, seven hundred sixty-seven thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •