Properties of the Number 49957

Forty-Nine Thousand Nine Hundred Fifty-Seven

Basics

Value: 49956 → 49957 → 49958

Parity: odd

Prime: Yes

Previous Prime: 49943

Next Prime: 49991

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 49957

Divisors: 1, 49957

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1100001100100101

Octal: 141445

Duodecimal: 24AB1

Hexadecimal: c325

Square: 2495701849

Square Root: 223.5106261456041

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

Number of 4-regular polyhedra with n nodes. A7022

Primes p such that q-p = 34, where q is the next prime after p. A134116

a(n) is the least k such that the generalized Fermat number (k+1)^2ⁿ + k^2ⁿ is prime. A80208

Lexicographically largest increasing sequence of primes for which the continued square root map (see A257574) produces the decimal expansion of e (Euler's number). A257764

Primes for which only three iterations of 'Prime plus its digit sum equals a prime' are possible. A48525

Primes p of the form p² + q + 1 where p < q are consecutive primes. A242230

Minimum value unattainable as the sum of 2 attained values of a·b*c with a,b,c 0..n integers. A225264

Numbers k such that 64^k - 63^k is prime. A62630

prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8·k))/k) = m with m = 9. A109563

a(n) is the least positive integer b such that b^2ⁿ + (b-1)^2ⁿ is prime. A253633