Base | Representation |
---|---|
bin | 1100111011111010011… |
… | …1000011101110101111 |
3 | 210020122101002211211021 |
4 | 3032332213003232233 |
5 | 12120122224221111 |
6 | 250032441035011 |
7 | 22025226250144 |
oct | 3167647035657 |
9 | 706571084737 |
10 | 222241242031 |
11 | 86285429566 |
12 | 370a4185a67 |
13 | 17c5a138413 |
14 | aa83cdc3cb |
15 | 5baad56d71 |
hex | 33be9c3baf |
222241242031 has 4 divisors (see below), whose sum is σ = 231903904752. Its totient is φ = 212578579312.
The previous prime is 222241242001. The next prime is 222241242079. The reversal of 222241242031 is 130242142222.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 222241242031 - 221 = 222239144879 is a prime.
It is a super-2 number, since 2×2222412420312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 222241241987 and 222241242005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222241242001) 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, 4831331326 + ... + 4831331371.
It is an arithmetic number, because the mean of its divisors is an integer number (57975976188).
Almost surely, 2222241242031 is an apocalyptic number.
222241242031 is a deficient number, since it is larger than the sum of its proper divisors (9662662721).
222241242031 is an equidigital number, since it uses as much as digits as its factorization.
222241242031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9662662720.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 222241242031 its reverse (130242142222), we get a palindrome (352483384253).
The spelling of 222241242031 in words is "two hundred twenty-two billion, two hundred forty-one million, two hundred forty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •