Properties of the Number 30461

Thirty Thousand Four Hundred Sixty-One

Basics

Value: 30460 → 30461 → 30462

Parity: odd

Prime: No

Previous Prime: 30449

Next Prime: 30467

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 83 × 367

Divisors: 1, 83, 367, 30461

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011011111101

Octal: 73375

Duodecimal: 15765

Hexadecimal: 76fd

Square: 927872521

Square Root: 174.5307995741726

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

Number of compositions (ordered partitions) of n into distinct parts. A32020

Number of ways to split a strict composition of n into contiguous subsequences all having the same sum. A336130

a(n) = ∑_k=0..2·n/3 C(n-k,2·k-n)². A298567

a(n) = (n³ - 2·n² + 3·n + 2)/2. A189890

Number of compositions of n into distinct parts, any two of which have a common divisor > 1. A337983

Odd composite numbers which in base 2 contain their largest proper factor as a substring of digits. A63131

Composite numbers not divisible by 2, 3, 5 or 7 which in base 2 contain their largest proper factor as a substring. A63138

Number of multisets of exactly six partitions of positive integers into distinct parts with total sum of parts equal to n. A320791

Number of compositions (ordered partitions) of n into distinct parts having a common factor > 1 with n. A332003

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 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) = 4. A49947