Base | Representation |
---|---|
bin | 10100101100101010… |
… | …110011000011001101 |
3 | 2010100211212000221102 |
4 | 110230222303003031 |
5 | 331003402100013 |
6 | 14113142512445 |
7 | 1414511014625 |
oct | 245452630315 |
9 | 63324760842 |
10 | 22224253133 |
11 | 9475014355 |
12 | 4382a35725 |
13 | 213244b554 |
14 | 110b877885 |
15 | 8a1178d58 |
hex | 52cab30cd |
22224253133 has 8 divisors (see below), whose sum is σ = 22293873888. Its totient is φ = 22154665104.
The previous prime is 22224253111. The next prime is 22224253147. The reversal of 22224253133 is 33135242222.
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-22224253133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22224253096 and 22224253105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22224253193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2675735 + ... + 2684027.
It is an arithmetic number, because the mean of its divisors is an integer number (2786734236).
Almost surely, 222224253133 is an apocalyptic number.
It is an amenable number.
22224253133 is a deficient number, since it is larger than the sum of its proper divisors (69620755).
22224253133 is an equidigital number, since it uses as much as digits as its factorization.
22224253133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16363.
The product of its digits is 17280, while the sum is 29.
Adding to 22224253133 its reverse (33135242222), we get a palindrome (55359495355).
The spelling of 22224253133 in words is "twenty-two billion, two hundred twenty-four million, two hundred fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •