Properties of the Number -268065

Two Hundred Sixty-Eight Thousand Sixty-Five

Basics

Value: -268066 → -268065 → -268064

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 7 × 23 × 37

Divisors: 1, 3, 5, 7, 9, 15, 21, 23, 35, 37

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1000001011100100001

Octal: -1013441

Duodecimal: -10B169

Hexadecimal: -41721

Square: 71858844225

Square Root: 517.7499396426812

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

a(n) = ∑_m=1..n T(m,n+1-m), array T as in A048887. A48888

Consider recurrence b(0) = (2n+1)/2, b(n) = b(n-1)*ceiling(b(n-1)); sequence gives first integer reached. A81853

First integer reached when starting with n/floor(sqrt(n)) and iterating the map x -> x·ceiling(x) A075120(n) times, or -1 if no integer is ever reached. A75121

First integer reached when starting with n/floor(log₂(n)) and iterating the map x -> x·ceiling(x) A075107(n) times, or -1 if no integer is ever reached. A75108

a(n) = (8·n - 3)*(4·n - 1)*(8·n² - 5·n + 1). A81854

The hyper-Wiener index of the Kneser graph K(n,2) (n>=5). A228307