Properties of the Number 90302

Ninety Thousand Three Hundred Two

Basics

Value: 90301 → 90302 → 90303

Parity: even

Prime: No

Previous Prime: 90289

Next Prime: 90313

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 163 × 277

Divisors: 1, 2, 163, 277, 326, 554, 45151, 90302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110000010111110

Octal: 260276

Duodecimal: 44312

Hexadecimal: 160be

Square: 8154451204

Square Root: 300.5029117995365

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) is the number of binary strings of length n such that there exist 4 or more ones in a subsequence of length 5 or less. A130902

Begin with n and consider numbers obtained by successively subtracting 0, 1, 2, 3, ...; a(n) = largest prime that arises in the process, i.e., largest prime of the form n - T(r), where T(r) is the r-th triangular number; or 0 if no such number exists. A90302