Base | Representation |
---|---|
bin | 1010000010100111101110… |
… | …1100000100110101101001 |
3 | 1110002102112102012221222020 |
4 | 2200221323230010311221 |
5 | 2421340202110234231 |
6 | 35251434254415053 |
7 | 2216423663005443 |
oct | 240517354046551 |
9 | 43072472187866 |
10 | 11040141102441 |
11 | 3577108922340 |
12 | 12a37a0b01489 |
13 | 6211087ab689 |
14 | 2a24ba793493 |
15 | 1422a5764396 |
hex | a0a7bb04d69 |
11040141102441 has 16 divisors (see below), whose sum is σ = 16062353265600. Its totient is φ = 6689342021120.
The previous prime is 11040141102379. The next prime is 11040141102443. The reversal of 11040141102441 is 14420114104011.
It is not a de Polignac number, because 11040141102441 - 26 = 11040141102377 is a prime.
It is a super-4 number, since 4×110401411024414 (a number of 53 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (11040141102443) 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, 41179020 + ... + 41446253.
It is an arithmetic number, because the mean of its divisors is an integer number (1003897079100).
Almost surely, 211040141102441 is an apocalyptic number.
11040141102441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11040141102441 is a deficient number, since it is larger than the sum of its proper divisors (5022212163159).
11040141102441 is a wasteful number, since it uses less digits than its factorization.
11040141102441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82629336.
The product of its (nonzero) digits is 512, while the sum is 24.
Adding to 11040141102441 its reverse (14420114104011), we get a palindrome (25460255206452).
The spelling of 11040141102441 in words is "eleven trillion, forty billion, one hundred forty-one million, one hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •