Base | Representation |
---|---|
bin | 1010000000100111… |
… | …1100010101111101 |
3 | 20221020222202120212 |
4 | 2200021330111331 |
5 | 21000330223041 |
6 | 1122342522205 |
7 | 123404535413 |
oct | 24011742575 |
9 | 6836882525 |
10 | 2686961021 |
11 | 11597a0648 |
12 | 62ba36365 |
13 | 33a89c884 |
14 | 1b6bdb2b3 |
15 | 10ad5b8eb |
hex | a027c57d |
2686961021 has 2 divisors, whose sum is σ = 2686961022. Its totient is φ = 2686961020.
The previous prime is 2686960999. The next prime is 2686961047. The reversal of 2686961021 is 1201696862.
It is a happy number.
2686961021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1903576900 + 783384121 = 43630^2 + 27989^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2686961021 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2686961021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2686961521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1343480510 + 1343480511.
It is an arithmetic number, because the mean of its divisors is an integer number (1343480511).
Almost surely, 22686961021 is an apocalyptic number.
It is an amenable number.
2686961021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2686961021 is an equidigital number, since it uses as much as digits as its factorization.
2686961021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 41.
The square root of 2686961021 is about 51835.9047475782. The cubic root of 2686961021 is about 1390.2314920765.
The spelling of 2686961021 in words is "two billion, six hundred eighty-six million, nine hundred sixty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •