Properties of the Number 90103

Ninety Thousand One Hundred Three

Basics

Value: 90102 → 90103 → 90104

Parity: odd

Prime: No

Previous Prime: 90089

Next Prime: 90107

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 13 × 29 × 239

Divisors: 1, 13, 29, 239, 377, 3107, 6931, 90103

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101111111110111

Octal: 257767

Duodecimal: 44187

Hexadecimal: 15ff7

Square: 8118550609

Square Root: 300.17161757901096

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(1) = a(2) = a(3) = a(4) = a(5) = 1 and for n>5: a(n) = a(n-4) + a(n-5). A103372

a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = 1 and for n>6: a(n) = a(n-5) + a(n-6). A103373

a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = a(7) = 1 and for n>7: a(n) = a(n-6) + a(n-7). A103374

a(1)=a(2)=...=a(10)=1, a(n)=a(n-9)+a(n-10). A103377

a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = a(7) = a(8) = 1 and for n>8: a(n) = a(n-7) + a(n-8). A103375

a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = a(7) = a(8) = a(9) = 1 and for n>9: a(n) = a(n-8) + a(n-9). A103376

Number of distinct ways to dissect a square into n rectangles of equal area. A108066

a(n) = if n mod 2 = 1 then n*(n - 1) else (n - 1)² + (n - 2)/2. A181995

Square array of sunflower numbers Sun(m,n) = minimal number of distinct sets of cardinality <= m such that there is a sunflower with at least n sets among them, read by falling antidiagonals; m, n >= 1. A332077

n written in base equal to the number of distinct prime factors of n and a(1)=0. A90103