Base | Representation |
---|---|
bin | 100000010101110101000… |
… | …011101110001110111001 |
3 | 21212110120012100110200101 |
4 | 200111311003232032321 |
5 | 242403100233031410 |
6 | 4420552425435401 |
7 | 316365452215462 |
oct | 40256503561671 |
9 | 7773505313611 |
10 | 2222462002105 |
11 | 7875a4951694 |
12 | 2ba88a03bb61 |
13 | 131767345147 |
14 | 797d3c15d69 |
15 | 3cc283ded3a |
hex | 205750ee3b9 |
2222462002105 has 8 divisors (see below), whose sum is σ = 2678600493000. Its totient is φ = 1770205541376.
The previous prime is 2222462002097. The next prime is 2222462002129. The reversal of 2222462002105 is 5012002642222.
2222462002105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 536403900816 + 1686058101289 = 732396^2 + 1298483^2 .
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 2222462002105 - 23 = 2222462002097 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 970506280 + ... + 970508569.
It is an arithmetic number, because the mean of its divisors is an integer number (334825061625).
Almost surely, 22222462002105 is an apocalyptic number.
It is an amenable number.
2222462002105 is a deficient number, since it is larger than the sum of its proper divisors (456138490895).
2222462002105 is a wasteful number, since it uses less digits than its factorization.
2222462002105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1941015083.
The product of its (nonzero) digits is 7680, while the sum is 28.
Adding to 2222462002105 its reverse (5012002642222), we get a palindrome (7234464644327).
The spelling of 2222462002105 in words is "two trillion, two hundred twenty-two billion, four hundred sixty-two million, two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •