Base | Representation |
---|---|
bin | 1100100110111000… |
… | …00111110100111101 |
3 | 122110201022000010202 |
4 | 12103130013310331 |
5 | 102330224341031 |
6 | 3035350213245 |
7 | 326506031645 |
oct | 62334076475 |
9 | 18421260122 |
10 | 6768590141 |
11 | 2963768a55 |
12 | 138a954225 |
13 | 83b3a2031 |
14 | 482d1d525 |
15 | 2993582cb |
hex | 193707d3d |
6768590141 has 4 divisors (see below), whose sum is σ = 6780486300. Its totient is φ = 6756693984.
The previous prime is 6768590099. The next prime is 6768590161. The reversal of 6768590141 is 1410958676.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 928420900 + 5840169241 = 30470^2 + 76421^2 .
It is a cyclic number.
It is not a de Polignac number, because 6768590141 - 222 = 6764395837 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6768590161) 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 3 ways as a sum of consecutive naturals, for example, 5947226 + ... + 5948363.
It is an arithmetic number, because the mean of its divisors is an integer number (1695121575).
Almost surely, 26768590141 is an apocalyptic number.
It is an amenable number.
6768590141 is a deficient number, since it is larger than the sum of its proper divisors (11896159).
6768590141 is a wasteful number, since it uses less digits than its factorization.
6768590141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11896158.
The product of its (nonzero) digits is 362880, while the sum is 47.
The square root of 6768590141 is about 82271.4418312940. The cubic root of 6768590141 is about 1891.6149556251.
The spelling of 6768590141 in words is "six billion, seven hundred sixty-eight million, five hundred ninety thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •