Base | Representation |
---|---|
bin | 10011011100010110011… |
… | …00010110101111110101 |
3 | 2100212100220201120011002 |
4 | 21232023030112233311 |
5 | 41421134112442210 |
6 | 1230522245253045 |
7 | 66160013350004 |
oct | 11561314265765 |
9 | 2325326646132 |
10 | 668055202805 |
11 | 238358822761 |
12 | a9582404185 |
13 | 4acc71b8093 |
14 | 24496890c3b |
15 | 1259e8724a5 |
hex | 9b8b316bf5 |
668055202805 has 4 divisors (see below), whose sum is σ = 801666243372. Its totient is φ = 534444162240.
The previous prime is 668055202781. The next prime is 668055202937. The reversal of 668055202805 is 508202550866.
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 466599652561 + 201455550244 = 683081^2 + 448838^2 .
It is a de Polignac number, because none of the positive numbers 2k-668055202805 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 668055202805.
It is a congruent number.
It is an unprimeable number.
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, 66805520276 + ... + 66805520285.
It is an arithmetic number, because the mean of its divisors is an integer number (200416560843).
Almost surely, 2668055202805 is an apocalyptic number.
It is an amenable number.
668055202805 is a deficient number, since it is larger than the sum of its proper divisors (133611040567).
668055202805 is a wasteful number, since it uses less digits than its factorization.
668055202805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133611040566.
The product of its (nonzero) digits is 1152000, while the sum is 47.
The spelling of 668055202805 in words is "six hundred sixty-eight billion, fifty-five million, two hundred two thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •