Properties of the Number 4527

Four Thousand Five Hundred Twenty-Seven

Basics

Value: 4526 → 4527 → 4528

Parity: odd

Prime: No

Previous Prime: 4523

Next Prime: 4547

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 503

Divisors: 1, 3, 9, 503, 1509, 4527

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000110101111

Octal: 10657

Duodecimal: 2753

Hexadecimal: 11af

Square: 20493729

Square Root: 67.28298447601742

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 regions after n generations of Jim Conant's iterative dissection of a square. A328078

Number of integer partitions of n that cannot be partitioned into constant multisets with distinct block-sums. A381717

Regular triangle read by rows where T(n,k) is the number of set partitions of {1,...,n} with k topologically connected components. A324173

Super-3 Numbers (3n³ contains substring '333' in its decimal expansion). A14569

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302965

Number of regions after 2n generations of Jim Conant's iterative dissection of a square. A328080

Expansion of f(-x⁴, -x¹⁶) / ψ(-x) in powers of·where ψ() is a Ramanujan θ function and f(, ) is Ramanujan's general θ function. A122130

Number of n-regular, N₀-weighted pseudographs on 2 vertices with total edge weight 8, up to isomorphism. A358248

Number of integer partitions of n without all different sums of two-element submultisets. A366753

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x². A368150