Properties of the Number 46505

Forty-Six Thousand Five Hundred Five

Basics

Value: 46504 → 46505 → 46506

Parity: odd

Prime: No

Previous Prime: 46499

Next Prime: 46507

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 71 × 131

Divisors: 1, 5, 71, 131, 355, 655, 9301, 46505

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011010110101001

Octal: 132651

Duodecimal: 22AB5

Hexadecimal: b5a9

Square: 2162715025

Square Root: 215.65017968923652

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 n such that h(n) = 3 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.) A78420

a(n) = 2·det(M(n; -1))/det(M(n; 0)), where M(n; m) is the n X n matrix with (i,j)-th element equal to 1/binomial(n + i + j + m, n). A7226

a(n) = 3·binomial(4·n,n)/(n+1). A7228

Number of distinct perforation patterns for deriving (v,b) = (n+2,n) punctured convolutional codes from (2,1). A7223

Number of distinct perforation patterns for deriving (v,b) = (n+2,n) punctured convolutional codes from (4,1). A7229

Number of distinct perforation patterns for deriving (v,b) = (n+3,n) punctured convolutional codes from (2,1). A7224

Number of distinct perforation patterns for deriving (v,b) = (n+4,n) punctured convolutional codes from (2,1). A7225

Primes with multiplicative persistence value 5. A46505

Number of distinct perforation patterns for deriving (v,b) = (n+2,n) punctured convolutional codes from (3,1). A7227