Base | Representation |
---|---|
bin | 1010000100000100101101… |
… | …1001001000001111010000 |
3 | 1110011210221212222111012110 |
4 | 2201001023121020033100 |
5 | 2422242311230224130 |
6 | 35311123112025320 |
7 | 2221266336345306 |
oct | 241011331101720 |
9 | 43153855874173 |
10 | 11065100633040 |
11 | 3586756928083 |
12 | 12a85a7992240 |
13 | 6235858157ac |
14 | 2a37a7604276 |
15 | 142c66ae0ab0 |
hex | a104b6483d0 |
11065100633040 has 80 divisors (see below), whose sum is σ = 34304772318336. Its totient is φ = 2950438848000.
The previous prime is 11065100632997. The next prime is 11065100633071. The reversal of 11065100633040 is 4033600156011.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 11065100632989 and 11065100633007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 805365 + ... + 4772715.
Almost surely, 211065100633040 is an apocalyptic number.
11065100633040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11065100633040 is an abundant number, since it is smaller than the sum of its proper divisors (23239671685296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11065100633040 is a wasteful number, since it uses less digits than its factorization.
11065100633040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3978988 (or 3978982 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 11065100633040 its reverse (4033600156011), we get a palindrome (15098700789051).
The spelling of 11065100633040 in words is "eleven trillion, sixty-five billion, one hundred million, six hundred thirty-three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •