Base | Representation |
---|---|
bin | 1001110011001100000110… |
… | …1100100011010011100000 |
3 | 1102011002020012111200101112 |
4 | 2130303001230203103200 |
5 | 2403014224040110000 |
6 | 34525551313322452 |
7 | 2161320141636332 |
oct | 234630154432340 |
9 | 42132205450345 |
10 | 10775027660000 |
11 | 348473323409a |
12 | 1260332b66428 |
13 | 602108534546 |
14 | 29372aa6b452 |
15 | 13a43abc8235 |
hex | 9ccc1b234e0 |
10775027660000 has 60 divisors (see below), whose sum is σ = 26508184346952. Its totient is φ = 4310011056000.
The previous prime is 10775027659997. The next prime is 10775027660077. The reversal of 10775027660000 is 6672057701.
It is a super-2 number, since 2×107750276600002 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10775027660000.
It is a congruent number.
It is an unprimeable number.
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, 269355692 + ... + 269395691.
Almost surely, 210775027660000 is an apocalyptic number.
10775027660000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10775027660000 is an abundant number, since it is smaller than the sum of its proper divisors (15733156686952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10775027660000 is an frugal number, since it uses more digits than its factorization.
10775027660000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538751413 (or 538751390 counting only the distinct ones).
The product of its (nonzero) digits is 123480, while the sum is 41.
The spelling of 10775027660000 in words is "ten trillion, seven hundred seventy-five billion, twenty-seven million, six hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •