Base | Representation |
---|---|
bin | 1001110011001100001001… |
… | …1101110000101110000000 |
3 | 1102011002021002210001212022 |
4 | 2130303002131300232000 |
5 | 2403014240340410000 |
6 | 34525552454021012 |
7 | 2161320356404553 |
oct | 234630235605600 |
9 | 42132232701768 |
10 | 10775040560000 |
11 | 348473a545052 |
12 | 1260337347768 |
13 | 60210b100092 |
14 | 29372c66869a |
15 | 13a43bdc5585 |
hex | 9ccc2770b80 |
10775040560000 has 80 divisors (see below), whose sum is σ = 26823790233240. Its totient is φ = 4310016192000.
The previous prime is 10775040559991. The next prime is 10775040560003. The reversal of 10775040560000 is 6504057701.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×107750405600002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10775040560003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 67264004 + ... + 67424003.
Almost surely, 210775040560000 is an apocalyptic number.
10775040560000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10775040560000 is an abundant number, since it is smaller than the sum of its proper divisors (16048749673240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10775040560000 is an frugal number, since it uses more digits than its factorization.
10775040560000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134688041 (or 134688014 counting only the distinct ones).
The product of its (nonzero) digits is 29400, while the sum is 35.
The spelling of 10775040560000 in words is "ten trillion, seven hundred seventy-five billion, forty million, five hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •