Base | Representation |
---|---|
bin | 100111110100111… |
… | …100100011011101 |
3 | 1201120022121122122 |
4 | 213310330203131 |
5 | 2332024102231 |
6 | 150145352325 |
7 | 22362346355 |
oct | 4764744335 |
9 | 1646277578 |
10 | 668190941 |
11 | 3131a3820 |
12 | 1679386a5 |
13 | a8582b72 |
14 | 64a57b65 |
15 | 3d9dc77b |
hex | 27d3c8dd |
668190941 has 4 divisors (see below), whose sum is σ = 728935584. Its totient is φ = 607446300.
The previous prime is 668190923. The next prime is 668190959. The reversal of 668190941 is 149091866.
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 an interprime number because it is at equal distance from previous prime (668190923) and next prime (668190959).
It is a cyclic number.
It is not a de Polignac number, because 668190941 - 226 = 601082077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 668190892 and 668190901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (668190911) 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, 30372305 + ... + 30372326.
It is an arithmetic number, because the mean of its divisors is an integer number (182233896).
Almost surely, 2668190941 is an apocalyptic number.
It is an amenable number.
668190941 is a deficient number, since it is larger than the sum of its proper divisors (60744643).
668190941 is a wasteful number, since it uses less digits than its factorization.
668190941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60744642.
The product of its (nonzero) digits is 93312, while the sum is 44.
The square root of 668190941 is about 25849.3895672606. The cubic root of 668190941 is about 874.2457460982.
The spelling of 668190941 in words is "six hundred sixty-eight million, one hundred ninety thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •