Properties of the Number 46752

Forty-Six Thousand Seven Hundred Fifty-Two

Basics

Value: 46751 → 46752 → 46753

Parity: even

Prime: No

Previous Prime: 46751

Next Prime: 46757

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁵ × 3 × 487

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011011010100000

Octal: 133240

Duodecimal: 23080

Hexadecimal: b6a0

Square: 2185749504

Square Root: 216.22210802783326

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

Number of ways to write n as a nonnegative linear combination of a strict integer partition. A365002

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally. A253164

a(n) counts the distinct cubical (on alphabet of 3 symbols) billiard words with length n, acting as prefix to just k = 1 such word of length n+1 (that is, not "special"). A180437

Smallest index i such that next_prime( 2·prime(i) ) - 2·prime(i) = 2n - 1. A74973

Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*xⁿ which is the numerator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = x + 1/2. A231730

Number of (n+1) X (2+1) 0..2 arrays with every 2 X 2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally. A253160

Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally. A253161

E.g.f. A(x) satisfies: A'(x) = A(x·A'(x)) with A(0)=1. A231619

Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges on k nodes and degree >= 3 at each node, n >= 3, 2 <= k <= floor(2·n/3). A46752

The Wiener index of the nanostar dendrimer NSC_5C_6[n], defined pictorially in the A. R. Ashrafi et al. reference and in the M. Rostami et al. reference. A221052