Base | Representation |
---|---|
bin | 1100110011010001… |
… | …11011001111001101 |
3 | 122201222000202012112 |
4 | 12121220323033031 |
5 | 103033342002431 |
6 | 3053543513405 |
7 | 332211135044 |
oct | 63150731715 |
9 | 18658022175 |
10 | 6872609741 |
11 | 2a07455468 |
12 | 13b9758865 |
13 | 856ac22aa |
14 | 492a7955b |
15 | 2a3553c2b |
hex | 199a3b3cd |
6872609741 has 8 divisors (see below), whose sum is σ = 7024286304. Its totient is φ = 6722573200.
The previous prime is 6872609729. The next prime is 6872609743. The reversal of 6872609741 is 1479062786.
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 6872609741 - 26 = 6872609677 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 6872609741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6872609743) 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 7 ways as a sum of consecutive naturals, for example, 401531 + ... + 418296.
It is an arithmetic number, because the mean of its divisors is an integer number (878035788).
Almost surely, 26872609741 is an apocalyptic number.
It is an amenable number.
6872609741 is a deficient number, since it is larger than the sum of its proper divisors (151676563).
6872609741 is a wasteful number, since it uses less digits than its factorization.
6872609741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820011.
The product of its (nonzero) digits is 1016064, while the sum is 50.
The square root of 6872609741 is about 82901.2047017412. The cubic root of 6872609741 is about 1901.2558401987.
The spelling of 6872609741 in words is "six billion, eight hundred seventy-two million, six hundred nine thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •