Base | Representation |
---|---|
bin | 110010100010111100000001… |
… | …001011110010001011101011 |
3 | 1002011002222111110201011111122 |
4 | 302202330001023302023223 |
5 | 213114204004411440021 |
6 | 2104444410041445455 |
7 | 64552610220450641 |
oct | 6242740113621353 |
9 | 1064088443634448 |
10 | 222303232140011 |
11 | 649182a9123060 |
12 | 20b23a327a088b |
13 | 9707149448459 |
14 | 3cc7768c27191 |
15 | 1aa793d20cbab |
hex | ca2f012f22eb |
222303232140011 has 8 divisors (see below), whose sum is σ = 242557385750064. Its totient is φ = 202056540008320.
The previous prime is 222303232139969. The next prime is 222303232140037. The reversal of 222303232140011 is 110041232303222.
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 222303232140011 - 238 = 222028354233067 is a prime.
It is not an unprimeable number, because it can be changed into a prime (222303232146011) 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, 1865307290 + ... + 1865426463.
It is an arithmetic number, because the mean of its divisors is an integer number (30319673218758).
Almost surely, 2222303232140011 is an apocalyptic number.
222303232140011 is a deficient number, since it is larger than the sum of its proper divisors (20254153610053).
222303232140011 is a wasteful number, since it uses less digits than its factorization.
222303232140011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3730739181.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 222303232140011 its reverse (110041232303222), we get a palindrome (332344464443233).
The spelling of 222303232140011 in words is "two hundred twenty-two trillion, three hundred three billion, two hundred thirty-two million, one hundred forty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •