Base | Representation |
---|---|
bin | 100000010100110111000… |
… | …001000010011011011001 |
3 | 21212100212122201201112000 |
4 | 200110313001002123121 |
5 | 242343432301023001 |
6 | 4420301243511213 |
7 | 316330612615521 |
oct | 40246701023331 |
9 | 7770778651460 |
10 | 2221421111001 |
11 | 787110339804 |
12 | 2ba639528509 |
13 | 13162c7bb951 |
14 | 797358a2681 |
15 | 3cbb6d32a86 |
hex | 205370426d9 |
2221421111001 has 32 divisors (see below), whose sum is σ = 3479332176000. Its totient is φ = 1396876083264.
The previous prime is 2221421110939. The next prime is 2221421111029. The reversal of 2221421111001 is 1001111241222.
2221421111001 is a `hidden beast` number, since 2 + 221 + 421 + 11 + 10 + 0 + 1 = 666.
It is not a de Polignac number, because 2221421111001 - 27 = 2221421110873 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2221421111051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9337230 + ... + 9572183.
It is an arithmetic number, because the mean of its divisors is an integer number (108729130500).
Almost surely, 22221421111001 is an apocalyptic number.
It is an amenable number.
2221421111001 is a deficient number, since it is larger than the sum of its proper divisors (1257911064999).
2221421111001 is a wasteful number, since it uses less digits than its factorization.
2221421111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18909670 (or 18909664 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 2221421111001 its reverse (1001111241222), we get a palindrome (3222532352223).
The spelling of 2221421111001 in words is "two trillion, two hundred twenty-one billion, four hundred twenty-one million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •