Properties of the Number 49681

Forty-Nine Thousand Six Hundred Eighty-One

Basics

Value: 49680 → 49681 → 49682

Parity: odd

Prime: Yes

Previous Prime: 49669

Next Prime: 49697

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 49681

Divisors: 1, 49681

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001000010001

Octal: 141021

Duodecimal: 24901

Hexadecimal: c211

Square: 2468201761

Square Root: 222.89235069871734

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Numbers k such that (3^k - 1)/2 is prime. A28491

Smallest prime in class n (sometimes written n+) according to the Erdős-Selfridge classification of primes. A5113

Primes p such that (p+1)/2, (p+2)/3 and (p+3)/4 are also primes. A163573

Class 8+ primes. A81636

Primes p such that p*(p-2) divides 2^p-1-1. A81762

Numbers k such that τ(k) + τ(k+1) + τ(k+2) + τ(k+3) = 16, where τ is the number of divisors function A000005. A350686

Numbers n such that (nⁿ-2)/(n-2) is an integer. A242787

a(n) = prime(n)² - n. A182174

Let Dedekind's ψ(m) = product of (p+1)p^e-1 for primes p, where p^e is a factor of m. Iterating ψ(m) eventually results in a number of form 2^a*3^b. a(n) is the smallest number that requires n steps to reach such a number. A19268

Primes p of the form |prime(n+2)²-prime(n+1)²-prime(n)²|, (absolute values). A176134