Base | Representation |
---|---|
bin | 1011101110010011… |
… | …00000101010011101 |
3 | 121020122011202000101 |
4 | 11313021200222131 |
5 | 100342222332320 |
6 | 2520313101101 |
7 | 311653453534 |
oct | 56711405235 |
9 | 17218152011 |
10 | 6293949085 |
11 | 273a852116 |
12 | 12779b7791 |
13 | 793c58638 |
14 | 439c8931b |
15 | 26c84dc0a |
hex | 177260a9d |
6293949085 has 8 divisors (see below), whose sum is σ = 7584341760. Its totient is φ = 5014090704.
The previous prime is 6293949071. The next prime is 6293949089. The reversal of 6293949085 is 5809493926.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6293949085 - 27 = 6293948957 is a prime.
It is a super-2 number, since 2×62939490852 = 79227590169144674450, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6293949089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2632257 + ... + 2634646.
It is an arithmetic number, because the mean of its divisors is an integer number (948042720).
Almost surely, 26293949085 is an apocalyptic number.
It is an amenable number.
6293949085 is a deficient number, since it is larger than the sum of its proper divisors (1290392675).
6293949085 is a wasteful number, since it uses less digits than its factorization.
6293949085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5267147.
The product of its (nonzero) digits is 4199040, while the sum is 55.
The square root of 6293949085 is about 79334.4129933536. The cubic root of 6293949085 is about 1846.3232634654.
The spelling of 6293949085 in words is "six billion, two hundred ninety-three million, nine hundred forty-nine thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •