Base | Representation |
---|---|

bin | 1011110101100010100001 |

3 | 12211122100112 |

4 | 23311202201 |

5 | 1243243011 |

6 | 150301105 |

7 | 35242205 |

oct | 13654241 |

9 | 5748315 |

10 | 3102881 |

11 | 182a271 |

12 | 1057795 |

13 | 848432 |

14 | 5aab05 |

15 | 41458b |

hex | 2f58a1 |

3102881 has 2 divisors, whose sum is σ = 3102882. Its totient is φ = 3102880.

The previous prime is 3102877. The next prime is 3102889. The reversal of 3102881 is 1882013.

Adding to 3102881 its reverse (1882013), we get a palindrome (4984894).

3102881 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., 2430481 + 672400 = 1559^2 + 820^2 .

It is a cyclic number.

It is not a de Polignac number, because 3102881 - 2^{2} = 3102877 is a prime.

It is a super-2 number, since 2×3102881^{2} = 19255741000322, which contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (3102889) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1551440 + 1551441.

It is an arithmetic number, because the mean of its divisors is an integer number (1551441).

Almost surely, 2^{3102881} is an apocalyptic number.

It is an amenable number.

3102881 is a deficient number, since it is larger than the sum of its proper divisors (1).

3102881 is an equidigital number, since it uses as much as digits as its factorization.

3102881 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 384, while the sum is 23.

The square root of 3102881 is about 1761.4996451887. The cubic root of 3102881 is about 145.8551293318.

The spelling of 3102881 in words is "three million, one hundred two thousand, eight hundred eighty-one".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •