Base | Representation |
---|---|
bin | 10011100010011110000… |
… | …11100011001001100101 |
3 | 2101011211220221222011211 |
4 | 21301033003203021211 |
5 | 41444401323304040 |
6 | 1232224312231421 |
7 | 66334314201163 |
oct | 11611703431145 |
9 | 2334756858154 |
10 | 671341228645 |
11 | 23979469259a |
12 | aa13a99b571 |
13 | 4b3cbc16979 |
14 | 246c9070233 |
15 | 126e30b48ea |
hex | 9c4f0e3265 |
671341228645 has 4 divisors (see below), whose sum is σ = 805609474380. Its totient is φ = 537072982912.
The previous prime is 671341228639. The next prime is 671341228661. The reversal of 671341228645 is 546822143176.
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 315593397729 + 355747830916 = 561777^2 + 596446^2 .
It is a cyclic number.
It is not a de Polignac number, because 671341228645 - 23 = 671341228637 is a prime.
It is a super-3 number, since 3×6713412286453 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67134122860 + ... + 67134122869.
It is an arithmetic number, because the mean of its divisors is an integer number (201402368595).
Almost surely, 2671341228645 is an apocalyptic number.
It is an amenable number.
671341228645 is a deficient number, since it is larger than the sum of its proper divisors (134268245735).
671341228645 is a wasteful number, since it uses less digits than its factorization.
671341228645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134268245734.
The product of its digits is 1935360, while the sum is 49.
The spelling of 671341228645 in words is "six hundred seventy-one billion, three hundred forty-one million, two hundred twenty-eight thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •