Properties of the Number -20115

Twenty Thousand One Hundred Fifteen

Basics

Value: -20116 → -20115 → -20114

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 149

Divisors: 1, 3, 5, 9, 15, 27, 45, 135, 149, 447

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: Yes

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100111010010011

Octal: -47223

Duodecimal: -B783

Hexadecimal: -4e93

Square: 404613225

Square Root: 141.82735984287376

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

T(n,k)=Petersen graph (3,1) coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223504

Number of partitions of n into lower Wythoff numbers (A000201). A192184

Deficient numbers n having a companion m > n such that σ(n)/n = σ(m)/m. A212608

Numbers k such that φ(k)+σ(k) is a perfect cube. A61366

Numbers n such that n + sum of prime factors of n = (n+1) + sum of prime factors of (n+1). A75654

Petersen graph (3,1) coloring a rectangular array: number of n X 3 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223499

Petersen graph (3,1) coloring a rectangular array: number of 4Xn 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223507

Numbers k such that the number of primes <= k is equal to the sum of primes from the smallest prime factor of k to the largest prime factor of k. A74210