Properties of the Number 45256

Forty-Five Thousand Two Hundred Fifty-Six

Basics

Value: 45255 → 45256 → 45257

Parity: even

Prime: No

Previous Prime: 45247

Next Prime: 45259

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 5657

Divisors: 1, 2, 4, 8, 5657, 11314, 22628, 45256

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011000011001000

Octal: 130310

Duodecimal: 22234

Hexadecimal: b0c8

Square: 2048105536

Square Root: 212.73457640919588

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

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 - 4·k*x - 4·x²). A386621

Consecutive states of the linear congruential pseudo-random number generator 254·s mod (2¹⁶+1) when started at s=1. A384934

Smallest number k such that 2ⁿ divides A066796(k) = Sum(i=1,k,binomial(2·i,i)). A126806

a(0) = 0; for n > 0, if the value of n itself appears in the sequence then a(n) = a(n-1) - (n-index(n)) if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + (n-index(n)), where index(n) is the index of the last appearance of n. If the value of n does not appear then a(n) = a(n-1) - n if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + n. A340733

Numbers whose base-5 representation contains exactly two 1's and one 4. A45256