Base | Representation |
---|---|
bin | 1010000011110101011100… |
… | …00001001011101100000001 |
3 | 2220022211202021221101200212 |
4 | 11001322232001023230001 |
5 | 10344421324241320001 |
6 | 115014412414323505 |
7 | 4442155544650316 |
oct | 501725601135401 |
9 | 86284667841625 |
10 | 22122001120001 |
11 | 7059984a05022 |
12 | 25934854b9595 |
13 | c461324ac533 |
14 | 5669d3b20d0d |
15 | 28569d84d7bb |
hex | 141eae04bb01 |
22122001120001 has 8 divisors (see below), whose sum is σ = 22182486488064. Its totient is φ = 22061529948400.
The previous prime is 22122001119997. The next prime is 22122001120039. The reversal of 22122001120001 is 10002110022122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22122001120001 - 22 = 22122001119997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22122001120201) 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, 424550 + ... + 6665151.
It is an arithmetic number, because the mean of its divisors is an integer number (2772810811008).
Almost surely, 222122001120001 is an apocalyptic number.
It is an amenable number.
22122001120001 is a deficient number, since it is larger than the sum of its proper divisors (60485368063).
22122001120001 is an equidigital number, since it uses as much as digits as its factorization.
22122001120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7098231.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 22122001120001 its reverse (10002110022122), we get a palindrome (32124111142123).
The spelling of 22122001120001 in words is "twenty-two trillion, one hundred twenty-two billion, one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •