Properties of the Number 46352

Forty-Six Thousand Three Hundred Fifty-Two

Basics

Value: 46351 → 46352 → 46353

Parity: even

Prime: No

Previous Prime: 46351

Next Prime: 46381

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 2897

Divisors: 1, 2, 4, 8, 16, 2897, 5794, 11588, 23176, 46352

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011010100010000

Octal: 132420

Duodecimal: 229A8

Hexadecimal: b510

Square: 2148507904

Square Root: 215.29514625276622

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

Multiply a(n-1) by 2 and drop all 0's. A242350

Number of relatively prime compositions of n with no 1's. A337450

Number of (n+2)X(2+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00000111. A261705

T(n,k) is the number of nondecreasing strings of numbers x(i=1..n) in -k..k with sum x(i)³ equal to 0, read by antidiagonals. A188277

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00000111. A261709

Composite numbers whose sum of prime factors is palindromic (counted with multiplicity). A46352

G.f. satisfies: A(x) = x + A(A(x))² - A(A(x))⁴. A171992