Base | Representation |
---|---|
bin | 1001110010100101… |
… | …0011000100000001 |
3 | 20210011011212121012 |
4 | 2130221103010001 |
5 | 20340241243211 |
6 | 1112440410305 |
7 | 122061145364 |
oct | 23451230401 |
9 | 6704155535 |
10 | 2628071681 |
11 | 1129529174 |
12 | 614176995 |
13 | 32b621301 |
14 | 1ad06c0db |
15 | 105ac7d8b |
hex | 9ca53101 |
2628071681 has 2 divisors, whose sum is σ = 2628071682. Its totient is φ = 2628071680.
The previous prime is 2628071653. The next prime is 2628071683. The reversal of 2628071681 is 1861708262.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2448270400 + 179801281 = 49480^2 + 13409^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2628071681 is a prime.
It is a super-2 number, since 2×26280716812 = 13813521520948331522, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 2628071683, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2628071683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1314035840 + 1314035841.
It is an arithmetic number, because the mean of its divisors is an integer number (1314035841).
Almost surely, 22628071681 is an apocalyptic number.
It is an amenable number.
2628071681 is a deficient number, since it is larger than the sum of its proper divisors (1).
2628071681 is an equidigital number, since it uses as much as digits as its factorization.
2628071681 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64512, while the sum is 41.
The square root of 2628071681 is about 51264.7216026772. The cubic root of 2628071681 is about 1379.9999441644. Note that the first 4 decimals are identical.
The spelling of 2628071681 in words is "two billion, six hundred twenty-eight million, seventy-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •