Properties of the Number -47563

Forty-Seven Thousand Five Hundred Sixty-Three

Basics

Value: -47564 → -47563 → -47562

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 47563

Divisors: 1, 47563

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1011100111001011

Octal: -134713

Duodecimal: -23637

Hexadecimal: -b9cb

Square: 2262238969

Square Root: 218.08943119738746

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

Maximum water retention of a number square of order n. A261347

Primes p such that continued fraction of (1 + sqrt(p))/2 has period 10 : primes in A146335. A146355

Primes formed by rearranging five consecutive decimal digits (avoiding leading 0). A156119

Let p_n be the polynomial of degree n-1 that interpolates the first n primes (i.e., p_n(i) = prime(i) for 1 <= i <= n.) Then a(n) = p_n(n+1)/2. A121049

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, -1), (-1, 1, 0), (1, 0, 0)}. A148532

Let u defined by u(1) = p and for 1 < i, u(i) = u(i-1) + primorial(i), such that all u(i) are primes for 1 <= i <= k, and u(k+1) is not prime. Let m the length of the longest run of primes obtained when u is repeatedly applied to an n-digit p. Triangle read by rows: for 1 <= n, 1 <= k <= m, T(n,k) is the least n-digit prime p beginning a run of only k primes when applied u, or -1 if no such prime p exists. A356732