Properties of the Number 20175

Twenty Thousand One Hundred Seventy-Five

Basics

Value: 20174 → 20175 → 20176

Parity: odd

Prime: No

Previous Prime: 20173

Next Prime: 20177

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 ² × 269

Divisors: 1, 3, 5, 15, 25, 75, 269, 807, 1345, 4035

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100111011001111

Octal: 47317

Duodecimal: B813

Hexadecimal: 4ecf

Square: 407030625

Square Root: 142.0387271134179

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

Sum of fifth powers of three consecutive primes. A133532

Partial sums of A053295. A53296

Antidiagonal sums of A086272 (and of A086273). A86274

a(n) = 4·a(n-1) - 3·a(n-2) - a(n-3), with a(0)=0, a(1)=0 and a(2)=1. A215404

Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives j values. A53677

Expansion of g.f. (1/2)*( a*(1+x)ⁿ + b*(1-x)ⁿ⁺²*LerchPhi(x, -n-1, 1) + c·2ⁿ⁺¹*(1-x)ⁿ⁺¹*LerchPhi(x, -n, 1/2) ), where a = -1, b = 1, and c = 1, read by rows. A168517

Number of partitions of n such that m(greatest part) >= m(1), where m = multiplicity. A240080

Triangle T(n,k) read by rows: the number of n X n {0,1} matrices with trace k where each row sum and each column sum is 2. A284989

Triangle T(n,t) read by rows: the number of n X n {0,1} matrices with trace t where each row sum and each column sum is 4. A284991

Greatest number in row n of array T given by A027926. A27988