Properties of the Number -25245

Twenty-Five Thousand Two Hundred Forty-Five

Basics

Value: -25246 → -25245 → -25244

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 11 × 17

Divisors: 1, 3, 5, 9, 11, 15, 17, 27, 33, 45

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110001010011101

Octal: -61235

Duodecimal: -12739

Hexadecimal: -629d

Square: 637310025

Square Root: 158.88675212238434

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

Odd infinitary abundant numbers. A127666

Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2·k, where bsigma is the sum of the bi-unitary divisors function (A188999). A293186

Reverse and add (in binary) - written in base 10. A35522

Number of partitions of n into decimal palindromes. A91580

Number of partitions of n into decimal repdigit numbers. A88669

Number of ordered 9-tuples of distinct pairwise coprime positive integers with largest element n. A186980

Triangle read by rows giving coefficients of polynomials arising in successive differences of central binomial numbers. A94796

Odd numbers k that are closer to being perfect than previous terms and also satisfy the condition that gcd(k, A003961(k)) is equal to gcd(σ(k), A003961(k)), where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and σ is the sum of divisors function. A386421

Odd primitive numbers such that n! divided by product of factorials of all proper divisors of n is not an integer. A75460

a(n) = n*(14·n + 13) + 3. A195029