Properties of the Number 70098

Seventy Thousand Ninety-Eight

Basics

Value: 70097 → 70098 → 70099

Parity: even

Prime: No

Previous Prime: 70079

Next Prime: 70099

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 7 × 1669

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 1669, 3338

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001000111010010

Octal: 210722

Duodecimal: 34696

Hexadecimal: 111d2

Square: 4913729604

Square Root: 264.76026892266145

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

A(n,k) is the n-th derivative of f_k at x=1, and f_k is the k-th of all functions that are representable as x^x^...^x with m>=1 x's and parentheses inserted in all possible ways; square array A(n,k), n>=0, k>=1, read by antidiagonals. A215703

Number array whose rows are the series reversions of x(1-x)/(1+x)^k, read by antidiagonals. A107111

Expansion of (1/x) * Series_Reversion( x*(1-x)/(1+x)⁵ ). A365755

n-th derivative of ((x^x)^x)^x at x=1. A215704

Seventh derivative of f_n at x=1, where f_n is the n-th of all functions that are representable as x^x^...^x with m>=1 x's and parentheses inserted in all possible ways. A215837

Triangle read by rows, coefficients of polynomials in t = log(x) of the n-th derivative of x^x³, evaluated at x = 1. T(n, k) with n >= 0 and 0 <= k <= n. A293474

a(n) = (1/(n+1)) * ∑_k=0..n binomial(n+k,k) * binomial(n*(n+1),n-k). A366012

Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,17. A64245

Grow a binary tree using the following rules. Initially there is a single node labeled 1. At each step we add 1 to all labels less than 3. If a node has label 3 and zero or one descendants we add a new descendant labeled 1. Sequence gives sum of all labels at step n. A123015

Number of integer triangles with perimeter n which are acute and isosceles. A70098