Base | Representation |
---|---|
bin | 1010000011011100111110… |
… | …1101011101011000010100 |
3 | 1110010210102121221101010220 |
4 | 2200313033231131120110 |
5 | 2422103441011400030 |
6 | 35302200532314340 |
7 | 2220441135456405 |
oct | 240671755353024 |
9 | 43123377841126 |
10 | 11054435653140 |
11 | 3582183812900 |
12 | 12a65101729b0 |
13 | 62257612abb9 |
14 | 2a30750219ac |
15 | 14284067ba10 |
hex | a0dcfb5d614 |
11054435653140 has 72 divisors (see below), whose sum is σ = 34022081321760. Its totient is φ = 2679863186880.
The previous prime is 11054435653127. The next prime is 11054435653147. The reversal of 11054435653140 is 4135653445011.
It is a junction number, because it is equal to n+sod(n) for n = 11054435653092 and 11054435653101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11054435653147) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 761317510 + ... + 761332029.
Almost surely, 211054435653140 is an apocalyptic number.
11054435653140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11054435653140 is an abundant number, since it is smaller than the sum of its proper divisors (22967645668620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11054435653140 is a wasteful number, since it uses less digits than its factorization.
11054435653140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1522649573 (or 1522649560 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 42.
The spelling of 11054435653140 in words is "eleven trillion, fifty-four billion, four hundred thirty-five million, six hundred fifty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •