Base | Representation |
---|---|
bin | 10100101100101010… |
… | …010101100110111101 |
3 | 2010100211121220112001 |
4 | 110230222111212331 |
5 | 331003334220131 |
6 | 14113140142301 |
7 | 1414510003222 |
oct | 245452254675 |
9 | 63324556461 |
10 | 22224132541 |
11 | 9474a41796 |
12 | 4382997991 |
13 | 21324086b0 |
14 | 110b845949 |
15 | 8a1153261 |
hex | 52ca959bd |
22224132541 has 4 divisors (see below), whose sum is σ = 23933681212. Its totient is φ = 20514583872.
The previous prime is 22224132529. The next prime is 22224132647. The reversal of 22224132541 is 14523142222.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13283484516 + 8940648025 = 115254^2 + 94555^2 .
It is a cyclic number.
It is not a de Polignac number, because 22224132541 - 215 = 22224099773 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22224432541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 854774316 + ... + 854774341.
It is an arithmetic number, because the mean of its divisors is an integer number (5983420303).
Almost surely, 222224132541 is an apocalyptic number.
It is an amenable number.
22224132541 is a deficient number, since it is larger than the sum of its proper divisors (1709548671).
22224132541 is a wasteful number, since it uses less digits than its factorization.
22224132541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1709548670.
The product of its digits is 7680, while the sum is 28.
Adding to 22224132541 its reverse (14523142222), we get a palindrome (36747274763).
The spelling of 22224132541 in words is "twenty-two billion, two hundred twenty-four million, one hundred thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •