Base | Representation |
---|---|
bin | 1100011011001101… |
… | …00111001100000101 |
3 | 122012220001111012112 |
4 | 12031212213030011 |
5 | 102130143123431 |
6 | 3021531430405 |
7 | 324206550101 |
oct | 61546471405 |
9 | 18186044175 |
10 | 6670676741 |
11 | 2913472193 |
12 | 1361bb5405 |
13 | 82400c201 |
14 | 473d12901 |
15 | 290966c2b |
hex | 18d9a7305 |
6670676741 has 4 divisors (see below), whose sum is σ = 6690471372. Its totient is φ = 6650882112.
The previous prime is 6670676737. The next prime is 6670676743. The reversal of 6670676741 is 1476760766.
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 1157020225 + 5513656516 = 34015^2 + 74254^2 .
It is a cyclic number.
It is not a de Polignac number, because 6670676741 - 22 = 6670676737 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6670676741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6670676743) 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, 9896810 + ... + 9897483.
It is an arithmetic number, because the mean of its divisors is an integer number (1672617843).
Almost surely, 26670676741 is an apocalyptic number.
It is an amenable number.
6670676741 is a deficient number, since it is larger than the sum of its proper divisors (19794631).
6670676741 is a wasteful number, since it uses less digits than its factorization.
6670676741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19794630.
The product of its (nonzero) digits is 1778112, while the sum is 50.
The square root of 6670676741 is about 81674.2109909854. The cubic root of 6670676741 is about 1882.4493445674.
The spelling of 6670676741 in words is "six billion, six hundred seventy million, six hundred seventy-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •