Properties of the Number 18058

Eighteen Thousand Fifty-Eight

Basics

Value: 18057 → 18058 → 18059

Parity: even

Prime: No

Previous Prime: 18049

Next Prime: 18059

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 9029

Divisors: 1, 2, 9029, 18058

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100011010001010

Octal: 43212

Duodecimal: A54A

Hexadecimal: 468a

Square: 326091364

Square Root: 134.3800580443393

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 integer partitions of n whose distinct parts are pairwise coprime. A304709

The number of regions formed inside an isosceles triangle by straight line segments mutually connecting all vertices and all points that divide the two equal length sides into n equal parts; the base of the triangle contains no points other than its vertices. A332953

a(n) = ∑_k=0..n binomial(4·n+k-1,n-k). A390338

Sum along upward diagonal of Pascal triangle up to (but not including) halfway point. A10755

Number of (binary) max-heaps on 2n elements from the set {0,1} containing n 0's and n 1's. A309050

Numbers k such that the continued fraction for sqrt(k) has period 79. A20418

T(n,n-5), array T as in A038792. A38795

Number of distinct solutions of sum{i=1..5}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2. A180828

Number of 0..n arrays x(0..11) of 12 elements with zero 6th differences. A200374

T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2. A180834