Properties of the Number 46051

Forty-Six Thousand Fifty-One

Basics

Value: 46050 → 46051 → 46052

Parity: odd

Prime: Yes

Previous Prime: 46049

Next Prime: 46061

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 46051

Divisors: 1, 46051

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011001111100011

Octal: 131743

Duodecimal: 22797

Hexadecimal: b3e3

Square: 2120694601

Square Root: 214.59496732216252

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

Primes from merging of 5 successive digits in decimal expansion of Catalan's constant. A104919

G.f.: ∑_k>=0 x^k * ∏_j=1..4·k (1 + x^j)/(1 - x^j). A385090

The number of vertices on a 2 by 1 ellipse formed by the straight line segments mutually connecting all points formed by dividing the ellipse into 2n equal angle sectors from its origin. A341762

Denominators of continued fraction convergents to sqrt(752). A42449

Primes p such that x⁵ = 2 has a solution mod p, but x^5² = 2 has no solution mod p. A70182

Primes that remain prime through 4 iterations of function f(x) = 2x + 9. A23306

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

A vector recursion sequence: k = 1; m = 2; l = 1; a(n)=k*{0,a(n-2),0}+m*{-(m-1)/m,a(n-1)}++m*{a(n-1),-(m-1)/m}+l*{0,0,a(n-4),0,0}. A152654

Numbers n of the form 4·k+3 such that 2^m-1 == 1 (mod m) where m = (2·n-1)*n. A187923

Number of prime factors of Mersenne number M(n) = 2ⁿ - 1 (counted with multiplicity). A46051