Base | Representation |
---|---|
bin | 111100011001010… |
… | …1111100011010001 |
3 | 12020020100022111222 |
4 | 1320302233203101 |
5 | 13122300133024 |
6 | 533032214425 |
7 | 101135354123 |
oct | 17062574321 |
9 | 5206308458 |
10 | 2026567889 |
11 | 94aa434a5 |
12 | 48683a415 |
13 | 263b1a0c8 |
14 | 153213213 |
15 | bcdae85e |
hex | 78caf8d1 |
2026567889 has 2 divisors, whose sum is σ = 2026567890. Its totient is φ = 2026567888.
The previous prime is 2026567861. The next prime is 2026567891. The reversal of 2026567889 is 9887656202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2023470289 + 3097600 = 44983^2 + 1760^2 .
It is a cyclic number.
It is not a de Polignac number, because 2026567889 - 28 = 2026567633 is a prime.
Together with 2026567891, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2026567889.
It is not a weakly prime, because it can be changed into another prime (2026567849) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1013283944 + 1013283945.
It is an arithmetic number, because the mean of its divisors is an integer number (1013283945).
Almost surely, 22026567889 is an apocalyptic number.
It is an amenable number.
2026567889 is a deficient number, since it is larger than the sum of its proper divisors (1).
2026567889 is an equidigital number, since it uses as much as digits as its factorization.
2026567889 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The square root of 2026567889 is about 45017.4176180731. The cubic root of 2026567889 is about 1265.4754344085.
The spelling of 2026567889 in words is "two billion, twenty-six million, five hundred sixty-seven thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •