Properties of the Number 90150

Ninety Thousand One Hundred Fifty

Basics

Value: 90149 → 90150 → 90151

Parity: even

Prime: No

Previous Prime: 90149

Next Prime: 90163

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 ² × 601

Divisors: 1, 2, 3, 5, 6, 10, 15, 25, 30, 50

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110000000100110

Octal: 260046

Duodecimal: 44206

Hexadecimal: 16026

Square: 8127022500

Square Root: 300.2498959200486

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

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4. A196300

Number of collinear triples of distinct points in Zn·Zn with no two on the same "horizontal" or "vertical" line. A146557

Triangle read by rows: T(n,k) (0 <= k <= n) = ∑_i=0..[k/2] (-1)ⁱ*binomial(k,2·i)*(2·i-1)!!*n^k-2·i. A244490

a(n) is the number of numbers k with 2^n-1 < k <= 2ⁿ having a number of divisors that is a power of 2. A36539

Number of nX3 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 3,0,1,4,2 for x=0,1,2,3,4. A196295

Array read by antidiagonals: T(n,k) is the number of functions f: X->Y, where X is a subset of Y, |X| = n, |Y| = n+k, such that for every·in X, f(f(x)) ≠ x. A334014

Primes of the form a string of identical digits preceded by a 2. A90150