Properties of the Number -46212

Forty-Six Thousand Two Hundred Twelve

Basics

Value: -46213 → -46212 → -46211

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 3851

Divisors: 1, 2, 3, 4, 6, 12, 3851, 7702, 11553, 15404

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1011010010000100

Octal: -132204

Duodecimal: -228B0

Hexadecimal: -b484

Square: 2135548944

Square Root: 214.96976531596252

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 read by rows, a generalization of the Bernoulli numbers, the numerators for n>=0 and 0<=k<=n. A292900

Integers j not of form 3m+2 such that for any integer k > 0, j·10^k+1 has a divisor in the set { 7, 11, 13, 37 }. A243969

Consider the Diophantine equation x³ + y³ = z³ - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y. A50789

G.f.: ∑_n>=0 (n+1)*(n+2)*(n+3)/3! * (x + xⁿ)ⁿ. A325999

Expansion of e.g.f. ∏_{i>=1, j>=1} 1/(1 - x^i·j/(i·j)). A318693

Number of integer partitions of n with fewer ones than greatest multiplicity. A382526