Base | Representation |
---|---|
bin | 100000010100100101000… |
… | …100111001100000000010 |
3 | 21212100002200101110111011 |
4 | 200110211010321200002 |
5 | 242342323223224442 |
6 | 4420211332511134 |
7 | 316320266424142 |
oct | 40244504714002 |
9 | 7770080343434 |
10 | 2221120133122 |
11 | 786a76457660 |
12 | 2ba57477b4aa |
13 | 1315b233aa27 |
14 | 79707916922 |
15 | 3cb9a6ce117 |
hex | 20525139802 |
2221120133122 has 128 divisors (see below), whose sum is σ = 3994674278400. Its totient is φ = 914914828800.
The previous prime is 2221120133077. The next prime is 2221120133129. The reversal of 2221120133122 is 2213310211222.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 2221120133093 and 2221120133102.
It is not an unprimeable number, because it can be changed into a prime (2221120133129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 595952023 + ... + 595955749.
It is an arithmetic number, because the mean of its divisors is an integer number (31208392800).
Almost surely, 22221120133122 is an apocalyptic number.
2221120133122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2221120133122 is a deficient number, since it is larger than the sum of its proper divisors (1773554145278).
2221120133122 is a wasteful number, since it uses less digits than its factorization.
2221120133122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4232.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2221120133122 its reverse (2213310211222), we get a palindrome (4434430344344).
The spelling of 2221120133122 in words is "two trillion, two hundred twenty-one billion, one hundred twenty million, one hundred thirty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •