Properties of the Number -21433

Twenty-One Thousand Four Hundred Thirty-Three

Basics

Value: -21434 → -21433 → -21432

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 21433

Divisors: 1, 21433

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -101001110111001

Octal: -51671

Duodecimal: -104A1

Hexadecimal: -53b9

Square: 459373489

Square Root: 146.40013661195812

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

Alternating sum of the numbers in the trajectory of n for the 3x+1 problem. A386437

a(n) = 25·n² - 36·n + 13. A154355

Primes whose decimal representation is a valid number in base 5 and interpreted as such is again a prime. A90708

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

Expansion of ∏_{1 <= i <= j <= k} (1 + x^i·j*k). A321359

Hypotenuses of primitive Pythagorean triples in A195680 and A195681. A195682

G.f.: ∑_n>=0 (1+x)ⁿ * ∏_k=1..n ((1+x)^k - 1). A207556

Lexicographically largest increasing sequence of primes for which the continued square root map (see A257574) produces π. A257582

Fifth term of weak prime sextet: p(m-3)-p(m-4) < p(m-2)-p(m-3) < p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m). A54832

Triangle read by rows: T(n,k) is the number of odd permutations of {1,2,...,n} with no fixed points and having k excedances (n>=1; k>=1). A145880