Properties of the Number -252105

Two Hundred Fifty-Two Thousand One Hundred Five

Basics

Value: -252106 → -252105 → -252104

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 7 ⁵

Divisors: 1, 3, 5, 7, 15, 21, 35, 49, 105, 147

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111101100011001001

Octal: -754311

Duodecimal: -101A89

Hexadecimal: -3d8c9

Square: 63556931025

Square Root: 502.1005875320203

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

Triangle of coefficients of polynomials P(n,t) related to the Mittag-Leffler function, where P(n,t) = ∏_k=0..n-2 n·t-k. A251592

Triangle read by rows: T(n, m) = S1(n, m)*7^n-m, where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n). A51186

Triangle of numbers related to rooted trees and unrooted planar trees. A56856

Triangle T(n,k) read by rows: T(n,k) is the number of rooted hypertrees on n labeled vertices with k hyperedges, n >= 2, k >= 1. A210586

Triangle, read by rows, where the g.f. of row n equals ∏_k=0..n-2 (n + k·y + n·y²) for n > 1 with a single '1' in row 1. A324305

Numbers k whose smallest prime factor is equal to the number of distinct prime factors of k and whose largest prime factor is equal to the number of prime factors of k counted with multiplicity. A392728

Triangular array T; for n>0, row n shows the coefficients of a reduced polynomial having zeros -k/(n+1) for k=1,2,...,n. A203904

Numbers whose digital sum is equal to the sum of primes from their smallest to largest prime factor. A76406

Triangle read by rows. T(n, k) = n^{n - k} * |Stirling1(n, k)|. A355006

Obverse convolution (n)**(n*(-1)ⁿ); see Comments. A374894