Properties of the Number 1413

One Thousand Four Hundred Thirteen

Basics

Value: 1412 → 1413 → 1414

Parity: odd

Prime: No

Previous Prime: 1409

Next Prime: 1423

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 157

Divisors: 1, 3, 9, 157, 471, 1413

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10110000101

Octal: 2605

Duodecimal: 999

Hexadecimal: 585

Square: 1996569

Square Root: 37.589892258425

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

Odd numbers of the form p^1+4k * r², where p is prime of the form 1+4m, r > 1, and gcd(p,r) = 1. (Euler's criteria for odd perfect numbers). A228058

Describe n. Also called the "Say What You See" or "Look and Say" sequence LS(n). A45918

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 4.8.8 2D tiling (cf. A008576). A299259

a(n) = floor(n(n+2)(2n+1)/8). A2717

a(1)=1; a(n) is the smallest positive integer that cannot be obtained from the integers {0, 1, ..., n-1} using each number at most once and the operators +, -, *, /. A60315

a(n) = ∑_k=1..n floor(n/k)². A222548

Coefficient triangle of certain polynomials. A56588

Numbers k whose largest divisor <= sqrt(k) equals 9. A162529

Trajectory of 82 under the map n-> A006368(n). A223088

Number of partitions of 4ⁿ into n-th powers. A27601