Base | Representation |
---|---|
bin | 1010101011110010… |
… | …1010111000001101 |
3 | 21101212201001212222 |
4 | 2222330222320031 |
5 | 21333203442424 |
6 | 1152331505125 |
7 | 131033601245 |
oct | 25274527015 |
9 | 7355631788 |
10 | 2868030989 |
11 | 1241a2414a |
12 | 6805b81a5 |
13 | 369259775 |
14 | 1d2c92b25 |
15 | 11bbc6e5e |
hex | aaf2ae0d |
2868030989 has 2 divisors, whose sum is σ = 2868030990. Its totient is φ = 2868030988.
The previous prime is 2868030973. The next prime is 2868031027. The reversal of 2868030989 is 9890308682.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2629946089 + 238084900 = 51283^2 + 15430^2 .
It is a cyclic number.
It is not a de Polignac number, because 2868030989 - 24 = 2868030973 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2868030989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2868030929) 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, 1434015494 + 1434015495.
It is an arithmetic number, because the mean of its divisors is an integer number (1434015495).
Almost surely, 22868030989 is an apocalyptic number.
It is an amenable number.
2868030989 is a deficient number, since it is larger than the sum of its proper divisors (1).
2868030989 is an equidigital number, since it uses as much as digits as its factorization.
2868030989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1492992, while the sum is 53.
The square root of 2868030989 is about 53554.0006815551. Note that the first 3 decimals coincide. The cubic root of 2868030989 is about 1420.7836362681.
The spelling of 2868030989 in words is "two billion, eight hundred sixty-eight million, thirty thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •