ℕ atory
Play Now

Properties of the Number 13492

Thirteen Thousand Four Hundred Ninety-Two

Basics

Value: 13491 → 13492 → 13493

Parity: even

Prime: No

Previous Prime: 13487

Next Prime: 13499

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 2 × 3373

Divisors: 1, 2, 4, 3373, 6746, 13492

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010010110100

Octal: 32264

Duodecimal: 7984

Hexadecimal: 34b4

Square: 182034064

Square Root: 116.15506876585283

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

Smallest composite that when added to sum of prime factors reaches a prime after n iterations. A50710
High temperature series for spin-1/2 Ising magnetic susceptibility on 2D square lattice. A2906
List of codewords in binary lexicode with Hamming distance 7 written as decimal numbers. A75937
Digitally balanced numbers (A031443) whose squares and cubes are also digitally balanced. A353140
Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 3,1,0,2. A37772
Partial sums of skinny numbers (A061909). A130596
Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A254904
Number of partitions of n into parts not of the form 17k, 17k+5 or 17k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 7 are greater than 1. A35966
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, 0), (1, -1, -1), (1, 1, 0)}. A150063
Consider all the Pythagorean triangles with perimeter A010814(n). Then a(n) is the sum of the areas of the squares on all of their sides. A334808