Base | Representation |
---|---|
bin | 1100101011011111… |
… | …11100110001001111 |
3 | 122120102012210220200 |
4 | 12111233330301033 |
5 | 102420134422114 |
6 | 3043252544543 |
7 | 330456311412 |
oct | 62557746117 |
9 | 18512183820 |
10 | 6807342159 |
11 | 2983626a12 |
12 | 139b922153 |
13 | 84641c817 |
14 | 488129b79 |
15 | 29c960409 |
hex | 195bfcc4f |
6807342159 has 12 divisors (see below), whose sum is σ = 9833560152. Its totient is φ = 4537890000.
The previous prime is 6807342151. The next prime is 6807342187. The reversal of 6807342159 is 9512437086.
6807342159 is digitally balanced in base 10, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 6807342159 - 23 = 6807342151 is a prime.
6807342159 is strictly pandigital in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6807342151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 181309 + ... + 215609.
It is an arithmetic number, because the mean of its divisors is an integer number (819463346).
It is a 1-persistent number, because it is pandigital, but 2⋅6807342159 = 13614684318 is not.
Almost surely, 26807342159 is an apocalyptic number.
6807342159 is the 44102-nd nonagonal number.
6807342159 is a deficient number, since it is larger than the sum of its proper divisors (3026217993).
6807342159 is a wasteful number, since it uses less digits than its factorization.
6807342159 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56358 (or 56355 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The square root of 6807342159 is about 82506.6188799420. The cubic root of 6807342159 is about 1895.2180912682.
The spelling of 6807342159 in words is "six billion, eight hundred seven million, three hundred forty-two thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •