Base | Representation |
---|---|
bin | 1000001011111010… |
… | …0101001100001101 |
3 | 12200010212200120102 |
4 | 2002332211030031 |
5 | 14000021141331 |
6 | 1002014500445 |
7 | 105311650232 |
oct | 20276451415 |
9 | 5603780512 |
10 | 2197443341 |
11 | a28443785 |
12 | 513b04725 |
13 | 290347a42 |
14 | 16bbb3789 |
15 | ccdb44cb |
hex | 82fa530d |
2197443341 has 4 divisors (see below), whose sum is σ = 2326704732. Its totient is φ = 2068181952.
The previous prime is 2197443331. The next prime is 2197443359. The reversal of 2197443341 is 1433447912.
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 1868746441 + 328696900 = 43229^2 + 18130^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2197443341 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2197443295 and 2197443304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2197443301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64630670 + ... + 64630703.
It is an arithmetic number, because the mean of its divisors is an integer number (581676183).
Almost surely, 22197443341 is an apocalyptic number.
It is an amenable number.
2197443341 is a deficient number, since it is larger than the sum of its proper divisors (129261391).
2197443341 is a wasteful number, since it uses less digits than its factorization.
2197443341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129261390.
The product of its digits is 72576, while the sum is 38.
The square root of 2197443341 is about 46876.8955990048. The cubic root of 2197443341 is about 1300.0874381030.
The spelling of 2197443341 in words is "two billion, one hundred ninety-seven million, four hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •