Properties of the Number 4012

Four Thousand Twelve

Basics

Value: 4011 → 4012 → 4013

Parity: even

Prime: No

Previous Prime: 4007

Next Prime: 4013

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 17 × 59

Divisors: 1, 2, 4, 17, 34, 59, 68, 118, 236, 1003

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111110101100

Octal: 7654

Duodecimal: 23A4

Hexadecimal: fac

Square: 16096144

Square Root: 63.340350488452465

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 matroids of rank 2 on n labeled points. A58681

Positions of occurrences of the natural numbers as fourth subsequence in A100035. A100039

Numbers k such that σ(k) = σ(k+12). A15882

Expansion of x*(1+x-x²)/((1-x)⁴*(1+x)). A5744

2·n analog to Keith numbers. A282757

a(n) = Frobenius number for 7 successive primes = F[p(n), p(n+1), p(n+2), p(n+3), p(n+4), p(n+5), p(n+6)]. A138993

T(n,k) = number of nonnegative integer arrays of length n+k-1 with new values 0 upwards introduced in order, and containing the value k-1. A211561

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 3. A50035

Array read by antidiagonals: T(n,m) = number of self-avoiding walks of any length from NW to SW corners on a grid with n rows and m columns. A271465

Sophie Germain 4-almost primes. A111176