Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …11011011011000100000001 |
3 | 2212222022012202112001221111 |
4 | 11000131302323123010001 |
5 | 10341303004212202221 |
6 | 114500512024523321 |
7 | 4432024164145120 |
oct | 500356273330401 |
9 | 85868182461844 |
10 | 22022225506561 |
11 | 70206341a8965 |
12 | 257807a920541 |
13 | c398c1315007 |
14 | 561c4a7cdab7 |
15 | 282cae188be1 |
hex | 140772edb101 |
22022225506561 has 4 divisors (see below), whose sum is σ = 25168257721792. Its totient is φ = 18876193291332.
The previous prime is 22022225506469. The next prime is 22022225506577. The reversal of 22022225506561 is 16560552222022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22022225506561 - 27 = 22022225506433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22022225507561) 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, 1573016107605 + ... + 1573016107618.
It is an arithmetic number, because the mean of its divisors is an integer number (6292064430448).
Almost surely, 222022225506561 is an apocalyptic number.
It is an amenable number.
22022225506561 is a deficient number, since it is larger than the sum of its proper divisors (3146032215231).
22022225506561 is an equidigital number, since it uses as much as digits as its factorization.
22022225506561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3146032215230.
The product of its (nonzero) digits is 288000, while the sum is 40.
Adding to 22022225506561 its reverse (16560552222022), we get a palindrome (38582777728583).
The spelling of 22022225506561 in words is "twenty-two trillion, twenty-two billion, two hundred twenty-five million, five hundred six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •