Base | Representation |
---|---|
bin | 1100111111101001100… |
… | …1001100100011110101 |
3 | 210100020021102110221110 |
4 | 3033322121030203311 |
5 | 12124201011204031 |
6 | 250320150505233 |
7 | 22062125511615 |
oct | 3177231144365 |
9 | 710207373843 |
10 | 223244241141 |
11 | 8674a610649 |
12 | 37324065219 |
13 | 18089b8570c |
14 | ab3b1caa45 |
15 | 5c18e2bc46 |
hex | 33fa64c8f5 |
223244241141 has 8 divisors (see below), whose sum is σ = 297731728480. Its totient is φ = 148793123952.
The previous prime is 223244241113. The next prime is 223244241191. The reversal of 223244241141 is 141142442322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 223244241141 - 27 = 223244241013 is a prime.
It is a super-3 number, since 3×2232442411413 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 223244241099 and 223244241108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223244241191) 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, 9078211 + ... + 9102768.
It is an arithmetic number, because the mean of its divisors is an integer number (37216466060).
Almost surely, 2223244241141 is an apocalyptic number.
It is an amenable number.
223244241141 is a deficient number, since it is larger than the sum of its proper divisors (74487487339).
223244241141 is a wasteful number, since it uses less digits than its factorization.
223244241141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18185075.
The product of its digits is 12288, while the sum is 30.
Adding to 223244241141 its reverse (141142442322), we get a palindrome (364386683463).
The spelling of 223244241141 in words is "two hundred twenty-three billion, two hundred forty-four million, two hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •