Properties of the Number 16058

Sixteen Thousand Fifty-Eight

Basics

Value: 16057 → 16058 → 16059

Parity: even

Prime: No

Previous Prime: 16057

Next Prime: 16061

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 7 × 31 × 37

Divisors: 1, 2, 7, 14, 31, 37, 62, 74, 217, 259

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111010111010

Octal: 37272

Duodecimal: 9362

Hexadecimal: 3eba

Square: 257859364

Square Root: 126.72016414130783

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

Numbers k such that prime(k) == 13 (mod k). A116658

Number of partitions into non-integral powers. A339

Coefficients of replicable function number "32b". A58632

Second order complementary Bell numbers. A265023

Number of (binary) max-heaps on n elements from the set {0,1} containing exactly six 0's. A326507

Numbers k such that A362555(k) = (5^k + 5·k)/5 is prime. A370557

Number of partitions of n into parts not of the form 15k, 15k+7 or 15k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 6 are greater than 1. A35961

Let F(n) denote the Fibonacci numbers, A000045: a(n) = ∑_k=0..n C(n,k)²*(n-k)!*F(k). A105277

Number of (n+1) X 4 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A204646

a(n) = lcm((d1 + 1), (d2 + 1), ..., (dk + 1)), where d1, d2, ..., dk are the prime factors of the n-th Fermat pseudoprime to base 2, A001567(n). A216404