ℕ atory
Play Now

Properties of the Number 30662

Thirty Thousand Six Hundred Sixty-Two

Basics

Value: 30661 → 30662 → 30663

Parity: even

Prime: No

Previous Prime: 30661

Next Prime: 30671

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 15331

Divisors: 1, 2, 15331, 30662

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111011111000110

Octal: 73706

Duodecimal: 158B2

Hexadecimal: 77c6

Square: 940158244

Square Root: 175.10568237495892

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 (0,1)-strings of length n not containing the substring 0100100. A62258
Sum of partial sums of partition numbers (A026905) and partial sums of numbers of partitions into distinct parts (A026906). A56871
Origin numbers: integers unreachable by Bergerson's α construction (see the Ross Eckler link). A68196
Number of 3 X n 0..1 arrays with diagonals and antidiagonals unimodal and rows nondecreasing. A223950
Number of nX4 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A241052
Expansion of ∑p prime, i>=1 xpi/(1 - xpi) / ∏p prime, j>=1 (1 - xpj). A281616
a(n) = ∑i+j+k+m=n, i,j,k,m >= 1 τ(i) * τ(j) * τ(k) * τ(m). A375002
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (1, -1, 1), (1, 0, 0), (1, 0, 1), (1, 1, -1)}. A150420
Number of combinations of n things from 1 to n at a time, with repeats allowed. A30662
T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A241054