Properties of the Number 466

Four Hundred Sixty-Six

Basics

Value: 465 → 466 → 467

Parity: even

Prime: No

Previous Prime: 463

Next Prime: 467

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 233

Divisors: 1, 2, 233, 466

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111010010

Octal: 722

Duodecimal: 32A

Hexadecimal: 1d2

Square: 217156

Square Root: 21.587033144922902

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

Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts. A124

The primes doubled; even semiprimes. A100484

Triangle T(n,k) 0<=k<n : Number of compositions of n with k adjacent equal parts. A106356

Number of binary vectors of length n containing no singletons. A6355

Infinite sequence starting with a(0)=0 such that A049820(a(k)) = a(k-1) for all k>=1, where A049820(n) = n - (number of divisors of n). A259934

Stolarsky array read by antidiagonals. A35506

Numbers k such that k⁴ + 1 is prime. A68

Numbers k with A033676(k)=2, where A033676 is the largest divisor <= sqrt(k). A161344

Triangle read by rows of partial sums of binomial coefficients: T(n,k) = ∑_i=0..k binomial(n,i) (0 <= k <= n); also dimensions of Reed-Muller codes. A8949

[s(k)-s(j)]/2, where the pairs (k,j) are given by A205837 and A205838. A205840