Base | Representation |
---|---|
bin | 10011100001111100111… |
… | …00001010111111110001 |
3 | 2101011010111102121002022 |
4 | 21300332130022333301 |
5 | 41443313443030031 |
6 | 1232140513401225 |
7 | 66324360612503 |
oct | 11607634127761 |
9 | 2334114377068 |
10 | 671062470641 |
11 | 2396612a7582 |
12 | aa081569215 |
13 | 4b3862456c4 |
14 | 246a0029d73 |
15 | 126c889e97b |
hex | 9c3e70aff1 |
671062470641 has 4 divisors (see below), whose sum is σ = 672833084400. Its totient is φ = 669291856884.
The previous prime is 671062470493. The next prime is 671062470671. The reversal of 671062470641 is 146074260176.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-671062470641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 671062470592 and 671062470601.
It is not an unprimeable number, because it can be changed into a prime (671062470671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 885306311 + ... + 885307068.
It is an arithmetic number, because the mean of its divisors is an integer number (168208271100).
Almost surely, 2671062470641 is an apocalyptic number.
It is an amenable number.
671062470641 is a deficient number, since it is larger than the sum of its proper divisors (1770613759).
671062470641 is a wasteful number, since it uses less digits than its factorization.
671062470641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1770613758.
The product of its (nonzero) digits is 338688, while the sum is 44.
The spelling of 671062470641 in words is "six hundred seventy-one billion, sixty-two million, four hundred seventy thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •