Base | Representation |
---|---|
bin | 1010000110110111100100… |
… | …0110101110100000000111 |
3 | 1110100101212220012212011110 |
4 | 2201231321012232200013 |
5 | 2424034123210414343 |
6 | 35345143202340103 |
7 | 2224616165056614 |
oct | 241557106564007 |
9 | 43311786185143 |
10 | 11113112201223 |
11 | 35a505413494a |
12 | 12b596695a633 |
13 | 627c6762b736 |
14 | 2a5c3dc0b50b |
15 | 144126b0a833 |
hex | a1b791ae807 |
11113112201223 has 8 divisors (see below), whose sum is σ = 15178884957936. Its totient is φ = 7228040456000.
The previous prime is 11113112201207. The next prime is 11113112201227. The reversal of 11113112201223 is 32210221131111.
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 11113112201223 - 24 = 11113112201207 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11113112201223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11113112201227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45175252728 + ... + 45175252973.
It is an arithmetic number, because the mean of its divisors is an integer number (1897360619742).
Almost surely, 211113112201223 is an apocalyptic number.
11113112201223 is a deficient number, since it is larger than the sum of its proper divisors (4065772756713).
11113112201223 is an equidigital number, since it uses as much as digits as its factorization.
11113112201223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90350505745.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 11113112201223 its reverse (32210221131111), we get a palindrome (43323333332334).
The spelling of 11113112201223 in words is "eleven trillion, one hundred thirteen billion, one hundred twelve million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •