Base | Representation |
---|---|
bin | 10011011100011000101… |
… | …10000010000100000101 |
3 | 2100212102021001210220001 |
4 | 21232030112002010011 |
5 | 41421204034013431 |
6 | 1230524215241301 |
7 | 66160336460602 |
oct | 11561426020405 |
9 | 2325367053801 |
10 | 668074516741 |
11 | 238368714595 |
12 | a9588979231 |
13 | 4accb1bb148 |
14 | 2449927b6a9 |
15 | 125a13d9e61 |
hex | 9b8c582105 |
668074516741 has 4 divisors (see below), whose sum is σ = 669309405484. Its totient is φ = 666839628000.
The previous prime is 668074516723. The next prime is 668074516751. The reversal of 668074516741 is 147615470866.
It is a happy number.
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 112670992225 + 555403524516 = 335665^2 + 745254^2 .
It is a cyclic number.
It is not a de Polignac number, because 668074516741 - 29 = 668074516229 is a prime.
It is a super-2 number, since 2×6680745167412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (668074516751) 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, 617443560 + ... + 617444641.
It is an arithmetic number, because the mean of its divisors is an integer number (167327351371).
Almost surely, 2668074516741 is an apocalyptic number.
It is an amenable number.
668074516741 is a deficient number, since it is larger than the sum of its proper divisors (1234888743).
668074516741 is a wasteful number, since it uses less digits than its factorization.
668074516741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1234888742.
The product of its (nonzero) digits is 6773760, while the sum is 55.
The spelling of 668074516741 in words is "six hundred sixty-eight billion, seventy-four million, five hundred sixteen thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •