Base | Representation |
---|---|
bin | 1011000001000001100010… |
… | …1101010010111111111011 |
3 | 1120212220202121010201200112 |
4 | 2300100120231102333323 |
5 | 3041421312402132303 |
6 | 41432140023254535 |
7 | 2360036105600102 |
oct | 260203055227773 |
9 | 46786677121615 |
10 | 12112222302203 |
11 | 394a8457a7501 |
12 | 143751a8aa44b |
13 | 69b2404293ba |
14 | 2dc33dda7039 |
15 | 16010018d0d8 |
hex | b0418b52ffb |
12112222302203 has 8 divisors (see below), whose sum is σ = 12868530685680. Its totient is φ = 11378490288480.
The previous prime is 12112222302179. The next prime is 12112222302209. The reversal of 12112222302203 is 30220322221121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12112222302203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12112222302209) 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, 5644091333 + ... + 5644093478.
It is an arithmetic number, because the mean of its divisors is an integer number (1608566335710).
Almost surely, 212112222302203 is an apocalyptic number.
12112222302203 is a deficient number, since it is larger than the sum of its proper divisors (756308383477).
12112222302203 is a wasteful number, since it uses less digits than its factorization.
12112222302203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11288184877.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 12112222302203 its reverse (30220322221121), we get a palindrome (42332544523324).
The spelling of 12112222302203 in words is "twelve trillion, one hundred twelve billion, two hundred twenty-two million, three hundred two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •