Base | Representation |
---|---|
bin | 100000010101100000101… |
… | …111010111100101001010 |
3 | 21212102200102220222020211 |
4 | 200111200233113211022 |
5 | 242401401001401442 |
6 | 4420454531311334 |
7 | 316354142614336 |
oct | 40254057274512 |
9 | 7772612828224 |
10 | 2222121122122 |
11 | 78743a4964a0 |
12 | 2ba7b3a4b54a |
13 | 131711833105 |
14 | 797a08407c6 |
15 | 3cc08508617 |
hex | 20560bd794a |
2222121122122 has 64 divisors (see below), whose sum is σ = 3675373056000. Its totient is φ = 999237096000.
The previous prime is 2222121122119. The next prime is 2222121122167. The reversal of 2222121122122 is 2212211212222.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 2222121122093 and 2222121122102.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1213609747 + ... + 1213611577.
It is an arithmetic number, because the mean of its divisors is an integer number (57427704000).
Almost surely, 22222121122122 is an apocalyptic number.
2222121122122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2222121122122 is a deficient number, since it is larger than the sum of its proper divisors (1453251933878).
2222121122122 is a wasteful number, since it uses less digits than its factorization.
2222121122122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3283.
The product of its digits is 512, while the sum is 22.
Adding to 2222121122122 its reverse (2212211212222), we get a palindrome (4434332334344).
The spelling of 2222121122122 in words is "two trillion, two hundred twenty-two billion, one hundred twenty-one million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •