Properties of the Number 45128

Forty-Five Thousand One Hundred Twenty-Eight

Basics

Value: 45127 → 45128 → 45129

Parity: even

Prime: No

Previous Prime: 45127

Next Prime: 45131

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 5641

Divisors: 1, 2, 4, 8, 5641, 11282, 22564, 45128

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011000001001000

Octal: 130110

Duodecimal: 22148

Hexadecimal: b048

Square: 2036536384

Square Root: 212.4335190124195

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 distinct integer partitions whose parts can be combined together using additions and multiplications to obtain n, with the exception that 1's can only be added and not multiplied with other parts. A319913

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235186

For even k >= 4, let f(k) = A066285(k/2) be the minimal difference between primes p and q whose sum is k. Such a k is in the sequence if f(k) > f(m) for all even m with 4 <= m < k. A65978

Numbers n such that there are precisely 15 groups of orders n and n + 1. A295995

One half of the sum over all permutations of [n] of the squared difference between the length of the longest increasing subsequence and the length of the longest decreasing subsequence. A321278

Number of (n+1) X (4+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235182

Number of (n+1) X (5+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A235183

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 461", based on the 5-celled von Neumann neighborhood. A272293

1/3 the number of n X n 0..2 symmetric matrices with every element equal to zero, one or three horizontal and vertical neighbors. A211040

Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303465