Base | Representation |
---|---|
bin | 1100101010110000… |
… | …10001100101011001 |
3 | 122112222112111121111 |
4 | 12111120101211121 |
5 | 102412042322321 |
6 | 3042511540321 |
7 | 330352462504 |
oct | 62530214531 |
9 | 18488474544 |
10 | 6801135961 |
11 | 2980078124 |
12 | 139982a6a1 |
13 | 845058a09 |
14 | 48739213b |
15 | 29c1365e1 |
hex | 195611959 |
6801135961 has 3 divisors (see below), whose sum is σ = 6801218431. Its totient is φ = 6801053492.
The previous prime is 6801135959. The next prime is 6801135977. The reversal of 6801135961 is 1695311086.
The square root of 6801135961 is 82469.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in only one way, i.e., 6768188361 + 32947600 = 82269^2 + 5740^2 .
It is not a de Polignac number, because 6801135961 - 21 = 6801135959 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6801135461) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 41235 + ... + 123703.
Almost surely, 26801135961 is an apocalyptic number.
6801135961 is the 82469-th square number.
6801135961 is the 41235-th centered octagonal number.
It is an amenable number.
6801135961 is a deficient number, since it is larger than the sum of its proper divisors (82470).
6801135961 is an frugal number, since it uses more digits than its factorization.
6801135961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164938 (or 82469 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 40.
The cubic root of 6801135961 is about 1894.6419645542.
The spelling of 6801135961 in words is "six billion, eight hundred one million, one hundred thirty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •