Base | Representation |
---|---|
bin | 1100110111101101000… |
… | …1001101001010010110 |
3 | 210010201122011221211102 |
4 | 3031323101031022112 |
5 | 12110314012040042 |
6 | 245324401310102 |
7 | 21655230141554 |
oct | 3157321151226 |
9 | 703648157742 |
10 | 221111440022 |
11 | 858557095a0 |
12 | 36a29935332 |
13 | 17b0a051915 |
14 | a9b7c42bd4 |
15 | 5b41a85b32 |
hex | 337b44d296 |
221111440022 has 8 divisors (see below), whose sum is σ = 361818720072. Its totient is φ = 100505200000.
The previous prime is 221111439979. The next prime is 221111440027. The reversal of 221111440022 is 220044111122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 221111439976 and 221111440003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221111440027) 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, 5025259979 + ... + 5025260022.
It is an arithmetic number, because the mean of its divisors is an integer number (45227340009).
Almost surely, 2221111440022 is an apocalyptic number.
221111440022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
221111440022 is a deficient number, since it is larger than the sum of its proper divisors (140707280050).
221111440022 is a wasteful number, since it uses less digits than its factorization.
221111440022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10050520014.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 221111440022 its reverse (220044111122), we get a palindrome (441155551144).
Subtracting from 221111440022 its reverse (220044111122), we obtain a square (1067328900 = 326702).
The spelling of 221111440022 in words is "two hundred twenty-one billion, one hundred eleven million, four hundred forty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •