Base | Representation |
---|---|
bin | 1100011101101101… |
… | …01100111111101001 |
3 | 122021100120011100020 |
4 | 12032312230333221 |
5 | 102201032001131 |
6 | 3024001431053 |
7 | 324553162635 |
oct | 61666547751 |
9 | 18240504306 |
10 | 6691672041 |
11 | 292430227a |
12 | 136903b489 |
13 | 828480672 |
14 | 476a19dc5 |
15 | 292712996 |
hex | 18edacfe9 |
6691672041 has 4 divisors (see below), whose sum is σ = 8922229392. Its totient is φ = 4461114692.
The previous prime is 6691672027. The next prime is 6691672051. The reversal of 6691672041 is 1402761966.
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 not a de Polignac number, because 6691672041 - 27 = 6691671913 is a prime.
It is a super-2 number, since 2×66916720412 = 89556949408602211362, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6691671984 and 6691672002.
It is not an unprimeable number, because it can be changed into a prime (6691672051) 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, 1115278671 + ... + 1115278676.
It is an arithmetic number, because the mean of its divisors is an integer number (2230557348).
Almost surely, 26691672041 is an apocalyptic number.
It is an amenable number.
6691672041 is a deficient number, since it is larger than the sum of its proper divisors (2230557351).
6691672041 is a wasteful number, since it uses less digits than its factorization.
6691672041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2230557350.
The product of its (nonzero) digits is 108864, while the sum is 42.
The square root of 6691672041 is about 81802.6407947812. The cubic root of 6691672041 is about 1884.4222176915.
The spelling of 6691672041 in words is "six billion, six hundred ninety-one million, six hundred seventy-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •