Base | Representation |
---|---|
bin | 1010001101110110100100… |
… | …0000100000110011101111 |
3 | 1110202212121010201121202210 |
4 | 2203131221000200303233 |
5 | 2433020342403033403 |
6 | 35520225423421503 |
7 | 2236364501651166 |
oct | 243355100406357 |
9 | 43685533647683 |
10 | 11233101221103 |
11 | 3640a2787a493 |
12 | 1315072a54893 |
13 | 63637a470098 |
14 | 2ab9838d63dd |
15 | 1472eab42b03 |
hex | a3769020cef |
11233101221103 has 4 divisors (see below), whose sum is σ = 14977468294808. Its totient is φ = 7488734147400.
The previous prime is 11233101221099. The next prime is 11233101221113. The reversal of 11233101221103 is 30112210133211.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 11233101221103 - 22 = 11233101221099 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11233101221103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11233101221113) 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, 1872183536848 + ... + 1872183536853.
It is an arithmetic number, because the mean of its divisors is an integer number (3744367073702).
Almost surely, 211233101221103 is an apocalyptic number.
11233101221103 is a deficient number, since it is larger than the sum of its proper divisors (3744367073705).
11233101221103 is an equidigital number, since it uses as much as digits as its factorization.
11233101221103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3744367073704.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11233101221103 its reverse (30112210133211), we get a palindrome (41345311354314).
The spelling of 11233101221103 in words is "eleven trillion, two hundred thirty-three billion, one hundred one million, two hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •