Properties of the Number 90071

Ninety Thousand Seventy-One

Basics

Value: 90070 → 90071 → 90072

Parity: odd

Prime: Yes

Previous Prime: 90067

Next Prime: 90073

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 90071

Divisors: 1, 90071

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10101111111010111

Octal: 257727

Duodecimal: 4415B

Hexadecimal: 15fd7

Square: 8112785041

Square Root: 300.11831000457136

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

Primes containing the digit string "007" in their decimal representation. A386240

Number of nondecreasing arrangements of n+2 numbers in 0..7 with each number being the sum mod 8 of two others. A183910

Prime(n), where n is such that (1+∑_i=1..n prime(i)⁵) / n is an integer. A234003

Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k ascents. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. An ascent is a maximal sequence of consecutive (1,1)-steps. A246186

Expansion of Molien series for Clifford group for the Quebbemann codes over F₈. A69247

Apery (Apéry) numbers: ∑_k=0..n (binomial(n,k)*binomial(n+k,k))². A5259

Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children. A94262

Number of labeled rooted trees of subsets of an n-set. A5172

Number of column-convex polyominoes with perimeter 2n+2. A5435

Number of directed column-convex polyominoes with perimeter 2n+2. A6027