Properties of the Number 498

Four Hundred Ninety-Eight

Basics

Value: 497 → 498 → 499

Parity: even

Prime: No

Previous Prime: 491

Next Prime: 499

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 83

Divisors: 1, 2, 3, 6, 83, 166, 249, 498

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111110010

Octal: 762

Duodecimal: 356

Hexadecimal: 1f2

Square: 248004

Square Root: 22.315913604421397

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

Denominators of Bernoulli numbers B_2n. A2445

Number of inseparable partitions of n; see Comments. A325535

Number of paths from (0,0) to (3n,0) that stay in first quadrant (but may touch horizontal axis) and where each step is (2,1), (1,2) or (1,-1). A27307

Primitive abundant numbers: abundant numbers (A005101) having no abundant proper divisor. A91191

Untouchable numbers, also called nonaliquot numbers: impossible values for the sum of aliquot parts function (A001065). A5114

Numbers k such that the k-th partition number A000041(k) is prime. A46063

Coordination sequence for "tcd" 3D uniform tiling. A299287

Triangle of number of rooted trees with n >= 2 nodes and height h >= 1. A34781

Admirable numbers. A number n is admirable if there exists a proper divisor d' of n such that σ(n)-2d'=2n, where σ(n) is the sum of all divisors of n. A111592

Unitary abundant numbers: numbers k such that usigma(k) > 2·k. A34683