Properties of the Number 35413

Thirty-Five Thousand Four Hundred Thirteen

Basics

Value: 35412 → 35413 → 35414

Parity: odd

Prime: No

Previous Prime: 35407

Next Prime: 35419

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 5059

Divisors: 1, 7, 5059, 35413

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000101001010101

Octal: 105125

Duodecimal: 185B1

Hexadecimal: 8a55

Square: 1254080569

Square Root: 188.1834211613765

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 compositions of n with a run of length > 2. A335464

T(n,k)=Number of nXk 0..1 arrays with row sums nondecreasing and column sums unimodal. A223625

Irregular triangle read by rows: T(n,k) is the number of non-isomorphic directed graphs reachable in k steps (and no fewer) by n agents using the LNS protocol (see A307085); n >= 1, 0 <= k <= A383387(n). A383385

Least n such that L(n)<-1 and L(n)>L(n-1), where L(k) means the least root of the polynomial p(k,x) defined at A206284, and a(1)=13. A206443

Interprimes which are of the form s·prime, s=7. A75282

Number of nX4 0..1 arrays with row sums nondecreasing and column sums unimodal. A223622

Number of 5Xn 0..1 arrays with row sums nondecreasing and column sums unimodal. A223629

p-INVERT of the odd positive integers, where p(S) = 1 + S - 3 S². A292493

First differences of A035403. A35413

Number of n-step paths on cubic lattice from (0,0,0) to (1,0,0) with moves in any direction on {-1,0,1}³ and zero moves allowed. A219670