Base | Representation |
---|---|
bin | 100000010101100000001… |
… | …100100100100000001101 |
3 | 21212102122210202112001221 |
4 | 200111200030210200031 |
5 | 242401341133000023 |
6 | 4420454004003341 |
7 | 316354002232303 |
oct | 40254014444015 |
9 | 7772583675057 |
10 | 2222112000013 |
11 | 787435325964 |
12 | 2ba7b0990551 |
13 | 13170c98b009 |
14 | 7979d548273 |
15 | 3cc0780585d |
hex | 2056032480d |
2222112000013 has 8 divisors (see below), whose sum is σ = 2370784965120. Its totient is φ = 2075434645440.
The previous prime is 2222112000001. The next prime is 2222112000103. The reversal of 2222112000013 is 3100002112222.
It is a happy number.
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 2222112000013 - 29 = 2222111999501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2222110000013) 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 7 ways as a sum of consecutive naturals, for example, 498900333 + ... + 498904786.
It is an arithmetic number, because the mean of its divisors is an integer number (296348120640).
Almost surely, 22222112000013 is an apocalyptic number.
It is an amenable number.
2222112000013 is a deficient number, since it is larger than the sum of its proper divisors (148672965107).
2222112000013 is a wasteful number, since it uses less digits than its factorization.
2222112000013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 997805267.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2222112000013 its reverse (3100002112222), we get a palindrome (5322114112235).
The spelling of 2222112000013 in words is "two trillion, two hundred twenty-two billion, one hundred twelve million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •