Properties of the Number -130023

One Hundred Thirty Thousand Twenty-Three

Basics

Value: -130024 → -130023 → -130022

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 14447

Divisors: 1, 3, 9, 14447, 43341, 130023

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11111101111100111

Octal: -375747

Duodecimal: -632B3

Hexadecimal: -1fbe7

Square: 16905980529

Square Root: 360.58702139705474

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 partially ordered sets ("posets") with n labeled elements (or labeled acyclic transitive digraphs). A1035

Triangular array read by rows: T(n,k) is the number of transitive relations on {1,2,...,n} that have exactly k reflexive points, n>=0, 0<=k<=n. A245767

Triangular array read by rows: T(n,k) is the number of ways to partition an n-set into exactly k blocks and then partially order the blocks, n>=1, 1<=k<=n. A247231

Triangle read by rows: T(n,k) = number of topologies on an n-set X such that there are exactly k elements in X that are topologically distinguishable, n >= 0, 0 <= k <= n. A280192

Triangular array read by rows. T(n,k) is the number of inequivalent (as defined below) transitive binary relations R on [n] such that |domain(R intersect R^-1)| = k, n>=0, 0<=k<=n. A369776

Triangular array read by rows. T(n,k) is the number of idempotent Boolean relation matrices with rank k, n >= 0, 0 <= k <= n. A363232