Properties of the Number -115069

One Hundred Fifteen Thousand Sixty-Nine

Basics

Value: -115070 → -115069 → -115068

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 23 × 5003

Divisors: 1, 23, 5003, 115069

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11100000101111101

Octal: -340575

Duodecimal: -56711

Hexadecimal: -1c17d

Square: 13240874761

Square Root: 339.21821885034416

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)=Half the number of (n+2)X(k+2) binary arrays with each 3X3 subblock having a sum in 2..7. A186796

Half the number of (n+2) X 3 binary arrays with each 3 X 3 subblock having a sum in 2..7. A186788

Half the number of (n+2)X6 binary arrays with each 3X3 subblock having a sum in 2..7. A186791

Composite numbers k such that if k = a U b (where U denotes concatenation) then a' + b' = k', where a', b' and k' are the arithmetic derivatives of a, b and k. A239724

Composite numbers k = concat(MSD(k),x) such that k' = x', where k' is the arithmetic derivative of k. A293477

The number of subsets X of Zn such that for all u, v in X, u+v is not in X. A206702

Composite numbers k = concat(MSD(k),x) such that the sum of the aliquot parts of k is equal to the sum of the aliquot parts of x. A293479