Base | Representation |
---|---|
bin | 100000001100000101011… |
… | …110010110110001100001 |
3 | 21211110120002020202100110 |
4 | 200030011132112301201 |
5 | 242220134000013441 |
6 | 4412102340441533 |
7 | 315545264532051 |
oct | 40140536266141 |
9 | 7743502222313 |
10 | 2212000001121 |
11 | 783116374489 |
12 | 2b884a3a92a9 |
13 | 13078aa18711 |
14 | 790c058d561 |
15 | 3c814bc2b16 |
hex | 20305796c61 |
2212000001121 has 16 divisors (see below), whose sum is σ = 2951101296000. Its totient is φ = 1473782923008.
The previous prime is 2212000001041. The next prime is 2212000001179. The reversal of 2212000001121 is 1211000002122.
It is not a de Polignac number, because 2212000001121 - 27 = 2212000000993 is a prime.
It is a super-3 number, since 3×22120000011213 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2212000001097 and 2212000001106.
It is not an unprimeable number, because it can be changed into a prime (2212000003121) 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 15 ways as a sum of consecutive naturals, for example, 43690980 + ... + 43741578.
It is an arithmetic number, because the mean of its divisors is an integer number (184443831000).
Almost surely, 22212000001121 is an apocalyptic number.
It is an amenable number.
2212000001121 is a deficient number, since it is larger than the sum of its proper divisors (739101294879).
2212000001121 is a wasteful number, since it uses less digits than its factorization.
2212000001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59048.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2212000001121 its reverse (1211000002122), we get a palindrome (3423000003243).
The spelling of 2212000001121 in words is "two trillion, two hundred twelve billion, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •