ℕ atory
Play Now

Properties of the Number 9858

Nine Thousand Eight Hundred Fifty-Eight

Basics

Value: 9857 → 9858 → 9859

Parity: even

Prime: No

Previous Prime: 9857

Next Prime: 9859

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 31 × 53

Divisors: 1, 2, 3, 6, 31, 53, 62, 93, 106, 159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011010000010

Octal: 23202

Duodecimal: 5856

Hexadecimal: 2682

Square: 97180164

Square Root: 99.2874614440313

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 integer compositions of n with the same length as the absolute value of their alternating sum. A357183
Numbers whose sum of divisors is a fourth power. A19422
T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..3 nXk array. A218522
Numbers n such that p(9n) is prime, where p(n) is the number of partitions of n. A114169
3 times 9-gonal (or nonagonal) numbers: a(n) = 3·n*(7·n-5)/2. A152759
T(n,k)=Number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors. A200871
Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the consecutive step patterns 010 or 101, where 1=up and 0=down; triangle T(n,k), n >= 0, k = max(0, n-3), read by rows. A295987
T(n,k)=Number of length n+4 0..k arrays with no five consecutive elements with pattern ababa or abbba (with a≠b) and new values 0..k introduced in 0..k order. A244702
a(n) = number of regions in the configuration A290447(n). A290865
T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random 0..3 nXk array. A218056