Base | Representation |
---|---|
bin | 1010001000101100101100… |
… | …0100100011001111100001 |
3 | 1110110102000222222220102101 |
4 | 2202023023010203033201 |
5 | 2430043020321233401 |
6 | 35411423033250401 |
7 | 2230111251065215 |
oct | 242131304431741 |
9 | 43412028886371 |
10 | 11144552133601 |
11 | 3607418161437 |
12 | 12bba7bb63a01 |
13 | 62ac08114113 |
14 | 2a75835a0945 |
15 | 144d66d66101 |
hex | a22cb1233e1 |
11144552133601 has 8 divisors (see below), whose sum is σ = 11176264045440. Its totient is φ = 11112841018752.
The previous prime is 11144552133593. The next prime is 11144552133703. The reversal of 11144552133601 is 10633125544111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11144552133601 - 23 = 11144552133593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11144552193601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38439540 + ... + 38728378.
It is an arithmetic number, because the mean of its divisors is an integer number (1397033005680).
Almost surely, 211144552133601 is an apocalyptic number.
It is an amenable number.
11144552133601 is a deficient number, since it is larger than the sum of its proper divisors (31711911839).
11144552133601 is a wasteful number, since it uses less digits than its factorization.
11144552133601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398495.
The product of its (nonzero) digits is 43200, while the sum is 37.
Adding to 11144552133601 its reverse (10633125544111), we get a palindrome (21777677677712).
The spelling of 11144552133601 in words is "eleven trillion, one hundred forty-four billion, five hundred fifty-two million, one hundred thirty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •