Base | Representation |
---|---|
bin | 1010000001000011001010… |
… | …0011100101001011000000 |
3 | 1102222211211222001002020010 |
4 | 2200100302203211023000 |
5 | 2420414404422210130 |
6 | 35231211344144520 |
7 | 2214446661164661 |
oct | 240206243451300 |
9 | 42884758032203 |
10 | 11013144335040 |
11 | 3566714957421 |
12 | 129a507908140 |
13 | 61b6c56902b3 |
14 | 2a1079153368 |
15 | 14172561c0b0 |
hex | a04328e52c0 |
11013144335040 has 112 divisors (see below), whose sum is σ = 36172482778080. Its totient is φ = 2835568189440.
The previous prime is 11013144335033. The next prime is 11013144335041. The reversal of 11013144335040 is 4053344131011.
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 = 11013144334989 and 11013144335007.
It is not an unprimeable number, because it can be changed into a prime (11013144335041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 197765701 + ... + 197821380.
Almost surely, 211013144335040 is an apocalyptic number.
11013144335040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11013144335040 is an abundant number, since it is smaller than the sum of its proper divisors (25159338443040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013144335040 is a wasteful number, since it uses less digits than its factorization.
11013144335040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395587130 (or 395587120 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 11013144335040 its reverse (4053344131011), we get a palindrome (15066488466051).
The spelling of 11013144335040 in words is "eleven trillion, thirteen billion, one hundred forty-four million, three hundred thirty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •