Base | Representation |
---|---|
bin | 1010000000100001… |
… | …1010111010010011 |
3 | 20221020020111011001 |
4 | 2200020122322103 |
5 | 21000224440224 |
6 | 1122330202431 |
7 | 123401254045 |
oct | 24010327223 |
9 | 6836214131 |
10 | 2686561939 |
11 | 1159548826 |
12 | 62b883417 |
13 | 33a790029 |
14 | 1b6b35a95 |
15 | 10accd544 |
hex | a021ae93 |
2686561939 has 4 divisors (see below), whose sum is σ = 2730604000. Its totient is φ = 2642519880.
The previous prime is 2686561919. The next prime is 2686561957. The reversal of 2686561939 is 9391656862.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2686561939 - 25 = 2686561907 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2686561939.
It is not an unprimeable number, because it can be changed into a prime (2686561919) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22020939 + ... + 22021060.
It is an arithmetic number, because the mean of its divisors is an integer number (682651000).
Almost surely, 22686561939 is an apocalyptic number.
2686561939 is a deficient number, since it is larger than the sum of its proper divisors (44042061).
2686561939 is an equidigital number, since it uses as much as digits as its factorization.
2686561939 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44042060.
The product of its digits is 4199040, while the sum is 55.
The square root of 2686561939 is about 51832.0551300062. The cubic root of 2686561939 is about 1390.1626604324.
It can be divided in two parts, 26865 and 61939, that added together give a square (88804 = 2982).
The spelling of 2686561939 in words is "two billion, six hundred eighty-six million, five hundred sixty-one thousand, nine hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •