Properties of the Number 30555

Thirty Thousand Five Hundred Fifty-Five

Basics

Value: 30554 → 30555 → 30556

Parity: odd

Prime: No

Previous Prime: 30553

Next Prime: 30557

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 7 × 97

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: 111011101011011

Octal: 73533

Duodecimal: 15823

Hexadecimal: 775b

Square: 933608025

Square Root: 174.79988558348657

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

a(n) = 7^n-5 * (n+1)^n-7 * (1296·n⁵ + 9720·n⁴ + 30555·n³ + 50665·n² + 44621·n + 16807). A251587

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

Triangle T(n, m) = T(n-1, m-1) + (4m-3)*T(n-1, m) read by rows 1<=m<=n. A111578

Numbers m such that φ(m) = τ(m)³. A68559

a(n) = 25·n² - 2·n. A154376

Half the difference between the larger and smaller term of the n-th amicable pair. A162884

Half the difference between the larger and smaller terms of the n-th amicable pair (x,y) given in A259933. A275470

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = ∑_{1 <= x₁, x₂, ..., x_k <= n} gcd(x₁, x₂, ..., x_k, n)^k. A372938

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) = (2n⁷ + 4n⁶ - n⁵ - 4n⁴ - n³) / 24. A245940