Base | Representation |
---|---|
bin | 10100110000001001… |
… | …10100000010000000 |
3 | 1001202110101100211102 |
4 | 22120010310002000 |
5 | 140304140124440 |
6 | 5041313233532 |
7 | 543043524521 |
oct | 123004640200 |
9 | 31673340742 |
10 | 11141333120 |
11 | 47a7aa0525 |
12 | 21ab2628a8 |
13 | 10872b0708 |
14 | 779980848 |
15 | 4531aab15 |
hex | 298134080 |
11141333120 has 32 divisors (see below), whose sum is σ = 26634751020. Its totient is φ = 4456532992.
The previous prime is 11141333087. The next prime is 11141333141. The reversal of 11141333120 is 2133314111.
It can be written as a sum of positive squares in 2 ways, for example, as 11119280704 + 22052416 = 105448^2 + 4696^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 11141333092 and 11141333101.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8703527 + ... + 8704806.
Almost surely, 211141333120 is an apocalyptic number.
11141333120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11141333120 is an abundant number, since it is smaller than the sum of its proper divisors (15493417900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11141333120 is an equidigital number, since it uses as much as digits as its factorization.
11141333120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17408352 (or 17408340 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11141333120 its reverse (2133314111), we get a palindrome (13274647231).
The spelling of 11141333120 in words is "eleven billion, one hundred forty-one million, three hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •