Properties of the Number -98253

Ninety-Eight Thousand Two Hundred Fifty-Three

Basics

Value: -98254 → -98253 → -98252

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 1213

Divisors: 1, 3, 9, 27, 81, 1213, 3639, 10917, 32751, 98253

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10111111111001101

Octal: -277715

Duodecimal: -48A39

Hexadecimal: -17fcd

Square: 9653652009

Square Root: 313.453345810824

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

Set partitions without singletons: number of partitions of an n-set into blocks of size > 1. Also number of cyclically spaced (or feasible) partitions. A296

Number of four-prime Carmichael numbers less than 10ⁿ. A174612

Triangle read by rows, arising in enumeration of permutations by cyclic peaks, cycles and fixed points. A216963

Number T(n,k) of set partitions of [n] such that at least one of the block sizes is k or k=0; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A327884

T(n,k) counts the set partitions of n containing k-1 blocks of length 1. A86659

Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the shortest block has length k (1 <= k <= n). A178979

Let sum(k>=0, kⁿ/(2·k+1)!) = (x(n)*e + y(n)/e)/z(n), where x(n) and z(n) are >0, then a(n)=x(n). A80093

Triangle of partitions of an n-set into boxes of size >= m. A282988

Triangle read by rows, T(n,k) = T(n-1,k-1) + k·T(n-1,k) + (k+1)*T(n-1,k+1), T(0,0) = 1, n >= 0, k >= 0. A217537