Base | Representation |
---|---|
bin | 1010101101100011101010… |
… | …1000011101010101111000 |
3 | 1112200221112000111012101110 |
4 | 2223120322220131111320 |
5 | 3020431400201310404 |
6 | 41014350030120320 |
7 | 2323626316164450 |
oct | 253307250352570 |
9 | 45627460435343 |
10 | 11777784010104 |
11 | 3830a26033682 |
12 | 13a27440500a0 |
13 | 675842886378 |
14 | 2ca0951b4d60 |
15 | 156579405b89 |
hex | ab63aa1d578 |
11777784010104 has 32 divisors (see below), whose sum is σ = 33650811457920. Its totient is φ = 3365081145696.
The previous prime is 11777784010063. The next prime is 11777784010129. The reversal of 11777784010104 is 40101048777711.
It is a super-2 number, since 2×117777840101042 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35052928434 + ... + 35052928769.
It is an arithmetic number, because the mean of its divisors is an integer number (1051587858060).
Almost surely, 211777784010104 is an apocalyptic number.
11777784010104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11777784010104 is an abundant number, since it is smaller than the sum of its proper divisors (21873027447816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11777784010104 is a wasteful number, since it uses less digits than its factorization.
11777784010104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70105857219 (or 70105857215 counting only the distinct ones).
The product of its (nonzero) digits is 307328, while the sum is 48.
The spelling of 11777784010104 in words is "eleven trillion, seven hundred seventy-seven billion, seven hundred eighty-four million, ten thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •