Properties of the Number 45231

Forty-Five Thousand Two Hundred Thirty-One

Basics

Value: 45230 → 45231 → 45232

Parity: odd

Prime: No

Previous Prime: 45197

Next Prime: 45233

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 15077

Divisors: 1, 3, 15077, 45231

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011000010101111

Octal: 130257

Duodecimal: 22213

Hexadecimal: b0af

Square: 2045843361

Square Root: 212.67580962582463

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

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

Numbers with 5 distinct digits {1,2,3,4,5} such that all adjacent digits (as well as first and last digits) are coprime. A104972

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 45231. A202233

Number of permutations avoiding the patterns {4321, 45132, 45231, 35412, 53412, 45213, 43512, 45312, 456123, 451623, 356124}; number of strong sorting class based on 4321. A111283

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

Numbers k whose trajectory under the Reverse and Add! operation carried out in base 16 does not reach a palindrome and (presumably) does not join the trajectory of any term m < k. A344119

a(n) = binomial(3·n,n)/(2·n+1) (enumerates ternary trees and also noncrossing trees). A1764

Number T(n,k) of defective (binary) heaps on n elements where k ancestor-successor pairs do not have the correct order; triangle T(n,k), n >= 0, 0 <= k <= A061168(n), read by rows. A306393

Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the generalized pattern 23-1; triangle T(n,k), n>=0, 0<=k<=A125811(n)-1, read by rows. A260670