Properties of the Number -10059

Ten Thousand Fifty-Nine

Basics

Value: -10060 → -10059 → -10058

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 479

Divisors: 1, 3, 7, 21, 479, 1437, 3353, 10059

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10011101001011

Octal: -23513

Duodecimal: -59A3

Hexadecimal: -274b

Square: 101183481

Square Root: 100.29456615390487

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

Number of binary vectors of length n+1 beginning with 0 and containing just 1 singleton. A6367

Number of ordered triples (i,j,k) with |i|,|j|,|k|,|i·j*k| <= n and gcd(i,j,k) <= 1. A226357

Number of integer partitions of n whose distinct parts have integer median. A360686

Lexicographically earliest sequence of positive integers with the property that a(a(n)) = a(1)+a(2)+...+a(n). A105753

Regular triangle where T(n,k) is the number of multiset partitions of strongly normal multisets of size n into k blocks, where a multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities. A317449

a(n) is the number of nonnegative integers that can be represented in a 7-segment display by using only n segments (version A063720). A343314

Consecutive states of the linear congruential pseudo-random number generator 259·s mod 2¹⁵ when started at s=1. A384194

Number of different strings of length n+4 obtained from "123...n" by iteratively duplicating any substring. A137741

Triangle read by rows: T(m,n) is the label of the ending square of an (m,n)-leaper (a generalization of a chess knight) when it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square. A323750

Number of (w,x,y,z) with all terms in {1,...,n} and 2w=x+y+z. A212068