Properties of the Number 50132

Fifty Thousand One Hundred Thirty-Two

Basics

Value: 50131 → 50132 → 50133

Parity: even

Prime: No

Previous Prime: 50131

Next Prime: 50147

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 83 × 151

Divisors: 1, 2, 4, 83, 151, 166, 302, 332, 604, 12533

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001111010100

Octal: 141724

Duodecimal: 25018

Hexadecimal: c3d4

Square: 2513217424

Square Root: 223.90176417348746

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

Integers k such that 11 + 210·k*i is prime for i = 0..7. A235393

Number of binary strings of length n avoiding 4-antipowers. A275061

a(n) is the smallest positive integer not yet in the increasing sequence that is obtained when the largest digit from a(n-1) is deleted and the remaining digits are permuted such that no digit in a(n) has the same position it had in a(n-1) (counting from left to right). No repeated digits allowed; a(1)=10. A302095

Number of winning positions for the next player (a, b, c) where 1 <= a, b, c <= n in "Divisor Nim" (see comments). A383226

a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 3·n. A50132

a(n) is the lexically first sequence of distinct nonzero integers such that if S(n) is the string formed from the digits of a(1)a(2)...a(n), then dividing S(n) into substrings with lengths equal to the successive digits of S(n) (treating 0 as 10) results in substrings beginning with the successive digits of π (A000796). A171059