Base | Representation |
---|---|
bin | 1100011111011100… |
… | …11110010101001001 |
3 | 122022101001221012201 |
4 | 12033232132111021 |
5 | 102213302321131 |
6 | 3025243040201 |
7 | 325121353561 |
oct | 61756362511 |
9 | 18271057181 |
10 | 6706292041 |
11 | 2931588519 |
12 | 1371b10061 |
13 | 82b4cc057 |
14 | 478943da1 |
15 | 293b4e761 |
hex | 18fb9e549 |
6706292041 has 8 divisors (see below), whose sum is σ = 7064122400. Its totient is φ = 6348948480.
The previous prime is 6706292029. The next prime is 6706292113. The reversal of 6706292041 is 1402926076.
6706292041 = T66863 + T66864 + T66865.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 6-Lehmer number, since φ(6706292041) divides (6706292041-1)6.
It is a cyclic number.
It is not a de Polignac number, because 6706292041 - 229 = 6169421129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6706292441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93240 + ... + 148681.
It is an arithmetic number, because the mean of its divisors is an integer number (883015300).
Almost surely, 26706292041 is an apocalyptic number.
6706292041 is the 66865-th centered triangular number.
It is an amenable number.
6706292041 is a deficient number, since it is larger than the sum of its proper divisors (357830359).
6706292041 is a wasteful number, since it uses less digits than its factorization.
6706292041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243399.
The product of its (nonzero) digits is 36288, while the sum is 37.
The square root of 6706292041 is about 81891.9534569789. The cubic root of 6706292041 is about 1885.7935846181.
The spelling of 6706292041 in words is "six billion, seven hundred six million, two hundred ninety-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •