Base | Representation |
---|---|
bin | 110001100001111010111… |
… | …0101100001110111101101 |
3 | 220002202222002222110121122 |
4 | 1203003311311201313231 |
5 | 1343012424234202044 |
6 | 22251131000110325 |
7 | 1301546354533235 |
oct | 143036565416755 |
9 | 26082862873548 |
10 | 6807352647149 |
11 | 2194a8911383a |
12 | 91b3887653a5 |
13 | 3a4c136b4452 |
14 | 19769886acc5 |
15 | bc11ca01dee |
hex | 630f5d61ded |
6807352647149 has 16 divisors (see below), whose sum is σ = 7378718126400. Its totient is φ = 6258215343744.
The previous prime is 6807352647107. The next prime is 6807352647209. The reversal of 6807352647149 is 9417462537086.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 6807352647149 - 212 = 6807352643053 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6807352647091 and 6807352647100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6807352647049) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12508352 + ... + 13041225.
It is an arithmetic number, because the mean of its divisors is an integer number (461169882900).
It is a 2-persistent number, because it is pandigital, and so is 2⋅6807352647149 = 13614705294298, but 3⋅6807352647149 = 20422057941447 is not.
Almost surely, 26807352647149 is an apocalyptic number.
It is an amenable number.
6807352647149 is a deficient number, since it is larger than the sum of its proper divisors (571365479251).
6807352647149 is a wasteful number, since it uses less digits than its factorization.
6807352647149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25550012.
The product of its (nonzero) digits is 60963840, while the sum is 62.
The spelling of 6807352647149 in words is "six trillion, eight hundred seven billion, three hundred fifty-two million, six hundred forty-seven thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •