Properties of the Number -152460

One Hundred Fifty-Two Thousand Four Hundred Sixty

Basics

Value: -152461 → -152460 → -152459

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 × 7 × 11 ²

Divisors: 1, 2, 3, 4, 5, 6, 7, 9, 10, 11

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100101001110001100

Octal: -451614

Duodecimal: -74290

Hexadecimal: -2538c

Square: 23244051600

Square Root: 390.46126568457464

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

The number of walks of length 2n+1 on the square lattice that start from the origin (0,0) and end at the vertex (2,1). A337902

T(n, k) = ((2·n + 1)/2)*∑_{j, k, n} (-1)^{k + j}*(n + j)*binomial(2·n, n - j)* Stirling2(n - k + j, 1 - k + j) with T(0, 0) = 1. Triangle read by row, T(n, k) for 0 <= k <= n. A342312

Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity). A46366

Denominators of first difference of squares of harmonic numbers A001008/A002805. A103933

Numbers with prime factorization pqr^2s^2t². A190379

Number of ordered set partitions of [n] where the maximal block size equals eight. A320764

Triangle read by rows: T(n,k) is the number of forests of labeled rooted Greg hypertrees with n white vertices and k black vertices, 0 <= k < n. A370949

Number of tree-rooted maps of genus 1 with n edges: rooted maps on the torus with a distinguished spanning tree. A118445

Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n). A352880

Triangle t(n,r) = s(n,r)*s(n,r+1), where s(n,r) = lcm(n,n-1,...,n-r+1)/lcm(1,2,...,r-1,r), n >= 1 and 0 <= r < n. A241475