Properties of the Number 45472

Forty-Five Thousand Four Hundred Seventy-Two

Basics

Value: 45471 → 45472 → 45473

Parity: even

Prime: No

Previous Prime: 45439

Next Prime: 45481

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 7 ² × 29

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 29, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011000110100000

Octal: 130640

Duodecimal: 22394

Hexadecimal: b1a0

Square: 2067702784

Square Root: 213.24164696418944

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

Apply partial sum operator 4 times to primes. A178138

Molecular topological indices of the complete graph K_n. A181617

Number of hopping sequences in four-colored rooted trees with n nodes, starting and ending with the same "initial state" from all of the (two-colored) rooted trees in A198760. See comments. A198761

Irregular triangle read by rows: T(n,k) = total number of graceful labelings of connected graphs with n edges (n>=1) and k vertices (k>=1). A329790

a(n) is the product of the numbers k such that a(n-2·k) = a(n-k) and 0 < n-2·k < n-k < n. A329311

a(n) is the index of the first occurrence of n in A331284. A331285

Number of length n 1..(7+2) arrays with no leading partial sum equal to a prime. A254538

Number of length 6 1..(n+2) arrays with no leading partial sum equal to a prime. A254544

E.g.f. satisfies A(x) = exp(x·A(x)) * cosh(x·A(x)). A201595

T(n,k)=Number of length n 1..(k+2) arrays with no leading partial sum equal to a prime. A254539