Properties of the Number -76230

Seventy-Six Thousand Two Hundred Thirty

Basics

Value: -76231 → -76230 → -76229

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, 5, 6, 7, 9, 10, 11, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10010100111000110

Octal: -224706

Duodecimal: -38146

Hexadecimal: -129c6

Square: 5811012900

Square Root: 276.09780875624494

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

Expansion of ∏_k>=1 (1 - k²*x^k)^k. A294581

Numbers with exactly 5 distinct prime divisors {2,3,5,7,11}. A147572

Table read by rows, in which the n-th row lists all the primitive solutions k, in increasing order, such that k*σ(k) = A337875(n). A337876

Number of edges in the n-Pell graph. A364553

a(n) = (n¹ + 1!)*(n² + 2!)*(n³ + 3!)*(n⁴ + 4!)/2!. A131528

Denominators of Integral_x=0..π/2 sin(2·n*x)*log(cosec(x)) dx. A225123

Table read by antidiagonals in which entry T(n,k) in row n and column k gives the number of possible rhombus tilings of an octagon with interior angles of 135 degrees and sequences of side lengths {n, k, 1, 1, n, k, 1, 1} (as the octagon is traversed), n,k in {1,2,3,...}. A214457

a(n) = ∑_k=0..n binomial(n,k) * binomial(k², n). A346184

a(n) is the least number·such that x² + 1 and 2^x + 1 are both divisible by A387595(n). A387642

Triangle T(n, m) = binomial(n+2, m)*binomial(n+2, n-m), read by rows. A348539