Properties of the Number 21960

Twenty-One Thousand Nine Hundred Sixty

Basics

Value: 21959 → 21960 → 21961

Parity: even

Prime: No

Previous Prime: 21943

Next Prime: 21961

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 5 × 61

Divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101010111001000

Octal: 52710

Duodecimal: 10860

Hexadecimal: 55c8

Square: 482241600

Square Root: 148.18906842274163

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

Sum of divisors of cubes. A175926

Number of sublattices of index n in generic 4-dimensional lattice. A38991

a(n) = n*(14·n - 11). A195021

Smallest number having exactly n divisors that are not greater than the number's greatest prime factor. A87134

Numbers k such that σ(k) AND 3·k = 3·k, where AND is bitwise-and, A004198. A388022

The sum of divisors of the smallest cubefull number that is a multiple of n. A369720

a(n) = ∑_d∣n Moebius(n/d)*d^b-1/φ(n) for b = 5. A160891

First differences of A069475, successive differences of (n+1)⁶-n⁶. A69476

Sum of the squares of the first n Fibonacci numbers with index divisible by 3. A156084

a(n) = (n-2)*(14·n-39) for n > 2, otherwise a(n) = n. A195030