Base | Representation |
---|---|
bin | 110010100000000100111001… |
… | …011100011110100101010001 |
3 | 1002010102011222100211210201010 |
4 | 302200010321130132211101 |
5 | 213102443313012412112 |
6 | 2104214211130201133 |
7 | 64532446534122543 |
oct | 6240047134364521 |
9 | 1063364870753633 |
10 | 222106607544657 |
11 | 64851979719380 |
12 | 20ab18b95831a9 |
13 | 96c1742520144 |
14 | 3cbc03514d693 |
15 | 1aa278128363c |
hex | ca013971e951 |
222106607544657 has 32 divisors (see below), whose sum is σ = 330579452712960. Its totient is φ = 131478732947520.
The previous prime is 222106607544643. The next prime is 222106607544659. The reversal of 222106607544657 is 756445706601222.
It is a happy number.
It is not a de Polignac number, because 222106607544657 - 220 = 222106606496081 is a prime.
It is a super-2 number, since 2×2221066075446572 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222106607544597 and 222106607544606.
It is not an unprimeable number, because it can be changed into a prime (222106607544659) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 262329319 + ... + 263174627.
It is an arithmetic number, because the mean of its divisors is an integer number (10330607897280).
Almost surely, 2222106607544657 is an apocalyptic number.
It is an amenable number.
222106607544657 is a deficient number, since it is larger than the sum of its proper divisors (108472845168303).
222106607544657 is a wasteful number, since it uses less digits than its factorization.
222106607544657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030533.
The product of its (nonzero) digits is 33868800, while the sum is 57.
The spelling of 222106607544657 in words is "two hundred twenty-two trillion, one hundred six billion, six hundred seven million, five hundred forty-four thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •