Properties of the Number 10434

Ten Thousand Four Hundred Thirty-Four

Basics

Value: 10433 → 10434 → 10435

Parity: even

Prime: No

Previous Prime: 10433

Next Prime: 10453

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 37 × 47

Divisors: 1, 2, 3, 6, 37, 47, 74, 94, 111, 141

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10100011000010

Octal: 24302

Duodecimal: 6056

Hexadecimal: 28c2

Square: 108868356

Square Root: 102.14695296483396

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 partitions of n into parts each of which is used a different number of times. A98859

a(n) = Fibonacci(2·n+1) - 2^n-1. A61667

Consider Post's tag system applied to the word (100)ⁿ; a(n) = length of the longest word in the orbit, or -1 if the orbit is unbounded. A291795

Number of 4-block ordered tricoverings of an unlabeled n-set. A60488

dot product (n,n-1,...2,1).(3,4,...,n,1,2). A26054

A Seidel matrix A(n,k) read by antidiagonals upwards. A323833

Numbers k such that if x = σ(k) + τ(k) - k then k = σ(x) + τ(x) - x. A238226

For even n, a(n) = a(n-2) + a(n-1) + 2^n/2-2, n>2. For odd n, a(n) = a(n-2) + a(n-1). A79289

Expansion of g.f.: 4ⁿ*n!*(1-y)ⁿ⁺¹*f(x, y, m), where f(x, y, m) = 2^m+1*exp(2^m*t)/((1-y·exp(t))*(1 + (2^m+1-1)*exp(2^m*t))), and m = -2. A171694

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [xⁿ * y^k] 1 / ( (1-x) * (1-y) * (1 - log(1-x) * log(1-y))³ ). A382825