Properties of the Number 28965

Twenty-Eight Thousand Nine Hundred Sixty-Five

Basics

Value: 28964 → 28965 → 28966

Parity: odd

Prime: No

Previous Prime: 28961

Next Prime: 28979

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 1931

Divisors: 1, 3, 5, 15, 1931, 5793, 9655, 28965

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111000100100101

Octal: 70445

Duodecimal: 14919

Hexadecimal: 7125

Square: 838971225

Square Root: 170.1910690958841

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

Numbers n such that σ(n) is a Fibonacci number. A272412

a(n) = ∑_{i+j+k=n, i,j,k >= 1} σ(i) * σ(j) * σ(k). A374951

a(n) = 1·prime(n) + 2·prime(n-1) + ... + k·prime(n+1-k), where k=floor((n+1)/2) and prime(n) is the n-th prime. A23870

Size |S| of the largest subset S of {0,1}ⁿ whose measure m(S) is <= 2ⁿ, where m is the additive measure defined on each element·of S by m({x}) = 2^k(x), where k(x) is the number of non-null coordinates of x. A115993

Numbers n such that 3·n and n³ have the same digit sum. A260906

a(n) = 1·t(n) + 2·t(n-1) + ... + k·t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes). A23862

Values of m such that A139361(n)=4m+1. A139362

a(n) = floor( prime(n)³ / (n·log(n)) ). A259648

Indices of A002110(n) in A055932. A331938

Numbers k such that τ(k) and σ(k) are both Fibonacci numbers. A390231