Base | Representation |
---|---|
bin | 1010000000111001100010… |
… | …00011000101111101001001 |
3 | 2212222012100201201202012021 |
4 | 11000130301003011331021 |
5 | 10341243223234033001 |
6 | 114500210222444441 |
7 | 4431654613316206 |
oct | 500346103057511 |
9 | 85865321652167 |
10 | 22021120221001 |
11 | 7020117303520 |
12 | 2577a10733721 |
13 | c397763335a5 |
14 | 561b83ab6cad |
15 | 282c4710bba1 |
hex | 1407310c5f49 |
22021120221001 has 16 divisors (see below), whose sum is σ = 24927936979968. Its totient is φ = 19278234032400.
The previous prime is 22021120220987. The next prime is 22021120221019. The reversal of 22021120221001 is 10012202112022.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 22021120221001 - 25 = 22021120220969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22021120221041) 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 15 ways as a sum of consecutive naturals, for example, 327827541 + ... + 327894706.
It is an arithmetic number, because the mean of its divisors is an integer number (1557996061248).
Almost surely, 222021120221001 is an apocalyptic number.
It is an amenable number.
22021120221001 is a deficient number, since it is larger than the sum of its proper divisors (2906816758967).
22021120221001 is a wasteful number, since it uses less digits than its factorization.
22021120221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 655722372.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22021120221001 its reverse (10012202112022), we get a palindrome (32033322333023).
It can be divided in two parts, 2202112022 and 1001, that multiplied together give a palindrome (2204314134022).
The spelling of 22021120221001 in words is "twenty-two trillion, twenty-one billion, one hundred twenty million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •