Properties of the Number 9427

Nine Thousand Four Hundred Twenty-Seven

Basics

Value: 9426 → 9427 → 9428

Parity: odd

Prime: No

Previous Prime: 9421

Next Prime: 9431

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 857

Divisors: 1, 11, 857, 9427

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10010011010011

Octal: 22323

Duodecimal: 5557

Hexadecimal: 24d3

Square: 88868329

Square Root: 97.09273917240156

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 k that are the products of two distinct primes such that 2·k-1, 4·k-3, 8·k-7 and 16·k-15 are also products of two distinct primes. A177213

Numbers n such that the decimal expansions of both n and n² have 2 as smallest digit and 9 as largest digit. A257485

Numbers k such that k¹⁶ == 1 (mod 17³). A56088

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 1,3,2,0,4 for x=0,1,2,3,4. A196636

Numbers k that are the products of two distinct primes such that 2·k-1, 4·k-3, 8·k-7, 16·k-15 and 32·k-31 are also products of two distinct primes. A177214

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 1,4,2,0,3 for x=0,1,2,3,4. A196641

Numbers which need eleven 'Reverse and Add' steps to reach a palindrome. A65216

Hypercomma numbers: n occurs in the sequence S[k+1]=S[k]+10·last_digit(S[k-1])+first_digit(S[k]) for each "legal" splitting n=concat(S[0],S[1]). A166508

3-comma numbers: n occurs in the sequence S[k+1]=S[k]+10·last_digit(S[k-1])+first_digit(S[k]) for three different splittings n=concat(S[0],S[1]). A166513

Sum of all region numbers of all parts of all partitions of n. A210972