Properties of the Number 45312

Forty-Five Thousand Three Hundred Twelve

Basics

Value: 45311 → 45312 → 45313

Parity: even

Prime: No

Previous Prime: 45307

Next Prime: 45317

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁸ × 3 × 59

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: 1011000100000000

Octal: 130400

Duodecimal: 22280

Hexadecimal: b100

Square: 2053177344

Square Root: 212.86615513040113

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

Numbers k that divide the (left) concatenation of all numbers <= k written in base 25 (most significant digit on left). A29494

Numbers of the form p⁸*q·r where p, q, and r are distinct primes. A179747

Fixed points of the function A260529(n) = concatenation of the positions of digits 9, 8,..., 0 in the decimal representation of n, using 1 for the rightmost digit etc., skipping digits which don't occur. A260275

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 262", based on the 5-celled von Neumann neighborhood. A287290

Number of permutations of 1..n containing the relative rank sequence { 45312 } at any spacing. A158432

Number of reduced 3 X 3 magilatin squares with magic sum n. A174020

a(n) is the smallest number m such that the sum of the first m squares ends in n '0's. A174245

Permutations in S_n avoiding the patterns {4321, 34512, 45123, 35412, 43512, 45132, 45213, 53412, 45312, 45231}. A191721

Number of permutations avoiding the consecutive pattern 45312. A202219

Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^t+u+v) having two, three, four, six, seven or eight distinct values for every i,j,k<=n. A211597