ℕ atory
Play Now

Properties of the Number 98145

Ninety-Eight Thousand One Hundred Forty-Five

Basics

Value: 98144 → 98145 → 98146

Parity: odd

Prime: No

Previous Prime: 98143

Next Prime: 98179

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 3 × 5 × 727

Divisors: 1, 3, 5, 9, 15, 27, 45, 135, 727, 2181

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111111101100001

Octal: 277541

Duodecimal: 48969

Hexadecimal: 17f61

Square: 9632441025

Square Root: 313.28102400241227

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

Array A(n,k) = n·A(n,k-1) + A(n,k-2) read by upward antidiagonals, starting A(n,0) = 0, A(n,1) = 1. A172236
a(0) = 1, a(1) = 5, a(n+1) = 5·a(n) + a(n-1). A52918
Denominators of continued fraction convergents to sqrt(29). A41047
Triangle, read by rows, T(n, k) = Fibonacci(n, k), where Fibonacci(n, x) is the Fibonacci polynomial. A117715
Total number of sequences with pj copies of j and longest increasing subsequence of length k summed over all partitions [p1, p2, ..., pk] of n into distinct parts. A268700
Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=5. A172342
Array read by ascending antidiagonals. A(n, k) = Fibonacci(k, n), where Fibonacci(n, x) are the Fibonacci polynomials. A352361
Array A(n, k) = Fibonacci(n+1, k), with A(n, 0) = A(n, n) = 1, read by antidiagonals. A157103
p + P(p) where p is the n-th prime and P(p) is the unrestricted partition number of p. A98145