Base | Representation |
---|---|
bin | 100000001100010100001… |
… | …000111011000111101001 |
3 | 21211111012020012212200222 |
4 | 200030110020323013221 |
5 | 242221134441303230 |
6 | 4412143010135425 |
7 | 315554343041504 |
oct | 40142410730751 |
9 | 7744166185628 |
10 | 2212246041065 |
11 | 783232242985 |
12 | 2b88b8881575 |
13 | 1307c99a2798 |
14 | 7910511813b |
15 | 3c82b5c36e5 |
hex | 2031423b1e9 |
2212246041065 has 4 divisors (see below), whose sum is σ = 2654695249284. Its totient is φ = 1769796832848.
The previous prime is 2212246040999. The next prime is 2212246041067. The reversal of 2212246041065 is 5601406422122.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1656966221824 + 555279819241 = 1287232^2 + 745171^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2212246041065 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2212246041067) 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 3 ways as a sum of consecutive naturals, for example, 221224604102 + ... + 221224604111.
It is an arithmetic number, because the mean of its divisors is an integer number (663673812321).
Almost surely, 22212246041065 is an apocalyptic number.
It is an amenable number.
2212246041065 is a deficient number, since it is larger than the sum of its proper divisors (442449208219).
2212246041065 is an equidigital number, since it uses as much as digits as its factorization.
2212246041065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442449208218.
The product of its (nonzero) digits is 46080, while the sum is 35.
The spelling of 2212246041065 in words is "two trillion, two hundred twelve billion, two hundred forty-six million, forty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •