Base | Representation |
---|---|
bin | 1010001000101010101011… |
… | …0100101011000100011011 |
3 | 1110110100122021221120110021 |
4 | 2202022222310223010123 |
5 | 2430040413320203233 |
6 | 35411253225131311 |
7 | 2230061661301114 |
oct | 242125264530433 |
9 | 43410567846407 |
10 | 11144011100443 |
11 | 360716a8191a1 |
12 | 12bb94a929b37 |
13 | 62ab4ccc3160 |
14 | 2a75317a720b |
15 | 144d345e4e2d |
hex | a22aad2b11b |
11144011100443 has 4 divisors (see below), whose sum is σ = 12001242723568. Its totient is φ = 10286779477320.
The previous prime is 11144011100381. The next prime is 11144011100479. The reversal of 11144011100443 is 34400111044111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11144011100443 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11144011100483) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 428615811543 + ... + 428615811568.
It is an arithmetic number, because the mean of its divisors is an integer number (3000310680892).
Almost surely, 211144011100443 is an apocalyptic number.
11144011100443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11144011100443 is a deficient number, since it is larger than the sum of its proper divisors (857231623125).
11144011100443 is an equidigital number, since it uses as much as digits as its factorization.
11144011100443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 857231623124.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 11144011100443 its reverse (34400111044111), we get a palindrome (45544122144554).
The spelling of 11144011100443 in words is "eleven trillion, one hundred forty-four billion, eleven million, one hundred thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •