Properties of the Number 23643

Twenty-Three Thousand Six Hundred Forty-Three

Basics

Value: 23642 → 23643 → 23644

Parity: odd

Prime: No

Previous Prime: 23633

Next Prime: 23663

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 37 × 71

Divisors: 1, 3, 9, 37, 71, 111, 213, 333, 639, 2627

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110001011011

Octal: 56133

Duodecimal: 11823

Hexadecimal: 5c5b

Square: 558991449

Square Root: 153.76280434487398

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 minimum dominating sets in the n-Goldberg graph. A382431

Number of 1-2-3-4 trees with n edges and with thinning limbs. A 1-2-3-4 tree is an ordered tree with vertices of outdegree at most 4. A rooted tree with thinning limbs is such that if a node has k children, all its children have at most k children. A124499

a(n) = a(n-1) + a(a(n-1) mod n) + 1, a(0) = 1. A308576

a(n) = Max(n, R(n)), where R(n) (A004086) = digit reversal of n. A68637

G.f. A(x) satisfies [x^2·n] A(x)^3·n = -3 and [x^2·n+1] A(x)^3·n+1 = [x^2·n+1] A(x)^3·n+2 for n >= 1. A376225

a(n) = Min(n, R(n)), where R(n) (A004086) = digit reversal of n. A68636

Number of vertex-transitive graphs of valency 8 with n nodes. A23643

Number of nX4 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 4,3,0,2,2 for x=0,1,2,3,4. A197557