Properties of the Number -13825

Thirteen Thousand Eight Hundred Twenty-Five

Basics

Value: -13826 → -13825 → -13824

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 ² × 7 × 79

Divisors: 1, 5, 7, 25, 35, 79, 175, 395, 553, 1975

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11011000000001

Octal: -33001

Duodecimal: -8001

Hexadecimal: -3601

Square: 191130625

Square Root: 117.57976016304848

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

Convolution of A075298 with A056594. A75495

a(n) = n³ + 1. A1093

Number of loop-graphical integer partitions of 2n. A339656

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically. A208164

"Orderly" Friedman numbers (or "good" or "nice" Friedman numbers): Friedman numbers (A036057) where the construction digits are used in the proper order. A80035

Pierpont 4-almost primes: numbers with exactly 4 prime divisors, not necessarily distinct, of the form 2^K*3^L + 1. A111344

Number of partitions of n such that the number of odd parts is a part and the number of even parts is not a part. A240578

a(n) = ∑_d∣n (n/d)^d * binomial(d+n/d-1, d). A338662

Triangle read by rows: T(n,k) = number of functions from an n-element set into but not onto a k-element set. A101030

a(0) = a(1) = a(2) = 1; for n > 2, a(n) = (a(n-1) + 1)*(a(n-2) + 1) / a(n-3). A276123