Properties of the Number 28035

Twenty-Eight Thousand Thirty-Five

Basics

Value: 28034 → 28035 → 28036

Parity: odd

Prime: No

Previous Prime: 28031

Next Prime: 28051

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 7 × 89

Divisors: 1, 3, 5, 7, 9, 15, 21, 35, 45, 63

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110110000011

Octal: 66603

Duodecimal: 14283

Hexadecimal: 6d83

Square: 785961225

Square Root: 167.4365551485099

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

Odd primitive abundant numbers. A6038

O.g.f. A(x) satisfies: A(x) = 1 + Integral (x/A(x)⁴)' / (x/A(x)⁷)' dx. A303064

Odd admirable numbers: such that σ(n) = 2n + 2d for some d | n. A109729

Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors. A188439

G.f. A(x) satisfies: 1+x = A(x)² + A(x)⁴ - A(x)⁵. A249926

Primitive terms of A388034. A388035

Numbers·such that the sum of all their cyclic permutations is equal to that of all cyclic permutations of σ(x) and all cyclic permutations of Euler totient function φ(x). A247317

Numbers k with abundance 90: σ(k) - 2·k = 90. A389703

Odd numbers k such that gcd(A276086(σ(k)-k), A276086(k)) is equal to A276086(k), where A276086 is the primorial base exp-function, and σ is the sum of divisors function. A388267

a(n) = ∑_{k >= 1} floor(3*τ^n-k). A20958