Properties of the Number 30507

Thirty Thousand Five Hundred Seven

Basics

Value: 30506 → 30507 → 30508

Parity: odd

Prime: No

Previous Prime: 30497

Next Prime: 30509

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 10169

Divisors: 1, 3, 10169, 30507

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011100101011

Octal: 73453

Duodecimal: 157A3

Hexadecimal: 772b

Square: 930677049

Square Root: 174.66253175767264

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) = A078223(n+1)/A078223(n). A78224

Expansion of ∏_{i>=1, j>=1} (1 + x^{i·j*(j + 1}/2)). A327745

Timestamps Hmmss where H,mm,ss are three consecutive primes, 0 < H < 24. A234631

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 2. A49936

Numbers k such that 4·10^k + 19 is prime. A271548

Graham-Sloane-type lower bound on the size of a ternary (n,3,7) constant-weight code. A30507

Row sums of the triangle A325982. A325983

Least integer k >= 0 such that binomial(k·n,k+1) = -1 mod n, or -1 if no such integer exists. A383505

Iterated partial sums of Euler totient function (A000010). Square array read by descending antidiagonals. A370075