Base | Representation |
---|---|
bin | 1010000110111000010111… |
… | …0000010100011011111111 |
3 | 1110100102102200120020211101 |
4 | 2201232011300110123333 |
5 | 2424040042023243403 |
6 | 35345220223233531 |
7 | 2224624353021616 |
oct | 241560560243377 |
9 | 43312380506741 |
10 | 11113324431103 |
11 | 35a5152a10344 |
12 | 12b5a05a488a7 |
13 | 627c9c5a854b |
14 | 2a5c6009487d |
15 | 14413a57d71d |
hex | a1b85c146ff |
11113324431103 has 4 divisors (see below), whose sum is σ = 11170906423168. Its totient is φ = 11055742439040.
The previous prime is 11113324431037. The next prime is 11113324431151. The reversal of 11113324431103 is 30113442331111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11113324431103 - 229 = 11112787560191 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 (11113394431103) 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 3 ways as a sum of consecutive naturals, for example, 28790995743 + ... + 28790996128.
It is an arithmetic number, because the mean of its divisors is an integer number (2792726605792).
Almost surely, 211113324431103 is an apocalyptic number.
11113324431103 is a deficient number, since it is larger than the sum of its proper divisors (57581992065).
11113324431103 is an equidigital number, since it uses as much as digits as its factorization.
11113324431103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57581992064.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 11113324431103 its reverse (30113442331111), we get a palindrome (41226766762214).
The spelling of 11113324431103 in words is "eleven trillion, one hundred thirteen billion, three hundred twenty-four million, four hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •