Properties of the Number 27453

Twenty-Seven Thousand Four Hundred Fifty-Three

Basics

Value: 27452 → 27453 → 27454

Parity: odd

Prime: No

Previous Prime: 27449

Next Prime: 27457

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 9151

Divisors: 1, 3, 9151, 27453

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101100111101

Octal: 65475

Duodecimal: 13A79

Hexadecimal: 6b3d

Square: 753667209

Square Root: 165.68946858506126

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

Places k where A064608(k) (partial sums of unitary τ) is divisible by k. A64610

Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals eight. A288547

Number of zero-sum -n..n arrays of 4 elements with first through third differences also in -n..n. A202512

G.f.: ∑_k>=0 x^k² * ∏_j=1..k 1/(1 - x^j)³. A376709

Numbers k such that the first k digits of log₁₀(2) after the decimal point are primes. A81102

a(n)=a(n-1)+2·a(n-2)-[a(n-1)/2]-[a(n-4)/2]-[a(n-5)/2]. A173534

E.g.f. sqrt(1+arctan(2·x)). A191500

Number of permutations of length 3n with descent set {3, 6, ...} that avoid a certain pattern of length 4 or 5 (see Lewis, 2012, Appendix, for precise definition). A217824

Number of (n+2) X (n+2) 0..1 arrays x(i,j) with ∑_j=1..n+2 j·x(i,j) equal for every row, Sum{i=1..n+2} i·x(i,j) equal for every column, and upper left element zero. A232647

Number of (n+2)X(7+2) 0..1 arrays x(i,j) with every row sum{j·x(i,j), j=1..7+2} equal, and every column sum{i·x(i,j), i=1..n+2} equal, with upper left element zero. A232653