Properties of the Number -10456

Ten Thousand Four Hundred Fifty-Six

Basics

Value: -10457 → -10456 → -10455

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 1307

Divisors: 1, 2, 4, 8, 1307, 2614, 5228, 10456

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10100011011000

Octal: -24330

Duodecimal: -6074

Hexadecimal: -28d8

Square: 109327936

Square Root: 102.25458424931374

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

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 2·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 + 3·x². A368518

a(n+1) is the smallest number > a(n) such that the digits of a(n)² are all (with multiplicity) contained in the digits of a(n+1)², with a(0)=1. A14563

a(n+1) is the smallest number > a(n) such that the digits of a(n)² are all (with multiplicity) properly contained in the digits of a(n+1)², with a(0)=1. A65297

Opmanis's sequence: a(n) is the smallest integer k such that k or one of its nonzero substrings (regarded as an integer) is divisible by every integer in the range 1 through n. A177834

Starts of runs of 5 consecutive even numbers that are all totient numbers (A002202). A333022

Renewal array for central trinomial numbers A002426. A111960

Numbers n such that φ(n') = φ(n)', where φ(n) is the Euler totient function of n and n' is the arithmetic derivative of n. A260961

Expansion of 1/(1 - ∑_k>=1 x^k/(1 - x^2·k)). A320650

Number of binary words of length n with an even number of occurrences of the subword 0101. A332052

a(n) is the smallest number which can be represented as the sum of n distinct perfect powers (A001597) in exactly n ways, or -1 if no such number exists. A363040