Properties of the Number 30902

Thirty Thousand Nine Hundred Two

Basics

Value: 30901 → 30902 → 30903

Parity: even

Prime: No

Previous Prime: 30893

Next Prime: 30911

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 15451

Divisors: 1, 2, 15451, 30902

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100010110110

Octal: 74266

Duodecimal: 15A72

Hexadecimal: 78b6

Square: 954933604

Square Root: 175.78964702166053

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 steps to reach 0 when starting from 2ⁿ and iterating the map x -> x - (number of 1's in binary representation of x): a(n) = A071542(2ⁿ) = A218600(n)+1. A213710

Sum of the differences between the largest part and smallest part over all partitions of n into distinct parts. A117455

Triangle read by rows: T(n,k) = number of ways, summed over the free n-ominoes, that an n-omino with an assigned orientation can be maximally (partially) covered by k X 1 tiles. A308437

Triangular array read by rows: T(n,k) is the number of labeled posets on [n] that are composed of exactly k irreducible posets, n >= 0, 0 <= k <= n. A354615

From George Gilbert's marks problem: jumping 3 marks at a time (initial positions). A19592

Number of nondecreasing integer sequences of length 24 with sum zero and sum of absolute values 2n. A158158

Number of (n+2) X 4 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock. A190026

a(n) is the least positive integer that can be expressed as the sum of two distinct nonzero decimal palindromes in exactly n ways. A364836

a(n) = floor( exp(11/16)*n! ). A30902