Base | Representation |
---|---|
bin | 1010011010000101100111… |
… | …1001001100001111001111 |
3 | 1111111222011022202211220022 |
4 | 2212201121321030033033 |
5 | 2444441340031303403 |
6 | 40200551355212355 |
7 | 2260515444644561 |
oct | 246413171141717 |
9 | 44458138684808 |
10 | 11443301041103 |
11 | 3712093125398 |
12 | 13499564470bb |
13 | 65013899cab9 |
14 | 2b7c044b3331 |
15 | 14c9ee795d38 |
hex | a6859e4c3cf |
11443301041103 has 8 divisors (see below), whose sum is σ = 12136074067872. Its totient is φ = 10752709977856.
The previous prime is 11443301041093. The next prime is 11443301041121. The reversal of 11443301041103 is 30114010334411.
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 11443301041103 - 238 = 11168423134159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11443301041603) 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 7 ways as a sum of consecutive naturals, for example, 545480075 + ... + 545501052.
It is an arithmetic number, because the mean of its divisors is an integer number (1517009258484).
Almost surely, 211443301041103 is an apocalyptic number.
11443301041103 is a deficient number, since it is larger than the sum of its proper divisors (692773026769).
11443301041103 is a wasteful number, since it uses less digits than its factorization.
11443301041103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090981761.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 11443301041103 its reverse (30114010334411), we get a palindrome (41557311375514).
The spelling of 11443301041103 in words is "eleven trillion, four hundred forty-three billion, three hundred one million, forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •