Base | Representation |
---|---|
bin | 1010000110001010011100… |
… | …10100101100100001001101 |
3 | 2220121111020112221121212002 |
4 | 11003011032110230201031 |
5 | 10402224144000013401 |
6 | 115115242532122045 |
7 | 4451020154141654 |
oct | 503051624544115 |
9 | 86544215847762 |
10 | 22202000001101 |
11 | 708a8a7217498 |
12 | 25a6a90a66325 |
13 | c50841311c7b |
14 | 56a82268819b |
15 | 2877d1b9aa6b |
hex | 14314e52c84d |
22202000001101 has 8 divisors (see below), whose sum is σ = 22226407283520. Its totient is φ = 22177597856512.
The previous prime is 22202000001047. The next prime is 22202000001151. The reversal of 22202000001101 is 10110000020222.
It is a happy number.
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-22202000001101 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 (22202000001151) 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 7 ways as a sum of consecutive naturals, for example, 7395056 + ... + 9954438.
It is an arithmetic number, because the mean of its divisors is an integer number (2778300910440).
Almost surely, 222202000001101 is an apocalyptic number.
It is an amenable number.
22202000001101 is a deficient number, since it is larger than the sum of its proper divisors (24407282419).
22202000001101 is a wasteful number, since it uses less digits than its factorization.
22202000001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2568915.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 22202000001101 its reverse (10110000020222), we get a palindrome (32312000021323).
The spelling of 22202000001101 in words is "twenty-two trillion, two hundred two billion, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •