Properties of the Number 264

Two Hundred Sixty-Four

Basics

Value: 263 → 264 → 265

Parity: even

Prime: No

Previous Prime: 263

Next Prime: 269

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 11

Divisors: 1, 2, 3, 4, 6, 8, 11, 12, 22, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100001000

Octal: 410

Duodecimal: 1A0

Hexadecimal: 108

Square: 69696

Square Root: 16.24807680927192

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

Abundant numbers (sum of divisors of m exceeds 2m). A5101

Fibbinary numbers: if n = F(i1) + F(i2) + ... + F(ik) is the Zeckendorf representation of n (i.e., write n in Fibonacci number system) then a(n) = 2^{i1 - 2} + 2^{i2 - 2} + ... + 2^{ik - 2}. Also numbers whose binary representation contains no two adjacent 1's. A3714

a(n) = prime(n) + 1. A8864

4 times triangular numbers: a(n) = 2·n*(n+1). A46092

Numbers k such that k² + 1 is prime. A5574

Zumkeller or integer-perfect numbers: numbers n whose divisors can be partitioned into two disjoint sets with equal sum. A83207

Nonnegative multiples of 6. A8588

Numbers having k prime factors (counted with multiplicity), the largest of which is the k-th prime. A106529

Triangle T(n,k) read by rows: T(n,k) is the number of compositions of n with k descents, n>=0, 0<=k<=n. A238343

a(n) = n·d(n), where d(n) = number of divisors of n (A000005). A38040