Base | Representation |
---|---|
bin | 10100101011010011… |
… | …010110110101001101 |
3 | 2010022020201110201022 |
4 | 110223103112311031 |
5 | 330432020043041 |
6 | 14111003323525 |
7 | 1414112125412 |
oct | 245323266515 |
9 | 63266643638 |
10 | 22201331021 |
11 | 9463088661 |
12 | 43772205a5 |
13 | 212a78407c |
14 | 11087cc109 |
15 | 89e14c24b |
hex | 52b4d6d4d |
22201331021 has 4 divisors (see below), whose sum is σ = 22264945500. Its totient is φ = 22137716544.
The previous prime is 22201330993. The next prime is 22201331023. The reversal of 22201331021 is 12013310222.
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 12516015625 + 9685315396 = 111875^2 + 98414^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22201331021 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 (22201331023) 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, 31806716 + ... + 31807413.
It is an arithmetic number, because the mean of its divisors is an integer number (5566236375).
Almost surely, 222201331021 is an apocalyptic number.
It is an amenable number.
22201331021 is a deficient number, since it is larger than the sum of its proper divisors (63614479).
22201331021 is an equidigital number, since it uses as much as digits as its factorization.
22201331021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63614478.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 22201331021 its reverse (12013310222), we get a palindrome (34214641243).
The spelling of 22201331021 in words is "twenty-two billion, two hundred one million, three hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •