Properties of the Number 13042

Thirteen Thousand Forty-Two

Basics

Value: 13041 → 13042 → 13043

Parity: even

Prime: No

Previous Prime: 13037

Next Prime: 13043

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 6521

Divisors: 1, 2, 6521, 13042

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11001011110010

Octal: 31362

Duodecimal: 766A

Hexadecimal: 32f2

Square: 170093764

Square Root: 114.20157617125956

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

Numbers n such that n¹⁰²⁴ + 1 is prime (a generalized Fermat prime). A57002

Sum of numbers in the n-th antidiagonal of the reciprocity array of 0. A259574

Expansion of ∏_k>=1 (1 + x^2·k-1)^k*(3·k-2)*(1 + x^2·k)^k*(3·k+2). A294841

Numbers whose digits are a permutation of (0,...,m) for some m. A199168

Starting with a(1) = 0, a(2) = 1, a(n) = smallest nonnegative integer that shares all digits with previous terms. No repeated digits are allowed. A297062

Always start on the lowest digit of a(n), then visit all digits of a(n) in increasing order. The terms of the sequence are the smallest one that force the visitor to walk n steps to complete his tour (a single step drives you from a digit to the closest one). A336611

Positive numbers k such that k and 2·k are anagrams in base 6 (written in base 6). A23064

Positive numbers k such that k and 3·k are anagrams in base 6 (written in base 6). A23065

Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array. A219349

Let an integer with k+1 digits as n = d(k)*10^k + d(k-1)*10^k-1 + ... + d(0)*10⁰ and consider the transform T(n) = k·10^d(k) + (k-1)*10^d(k-1) + ... + 0·10^d(0). a(n) gives the fixed points of the transform T(n). A226767