Properties of the Number -1266767

Two Hundred Sixty-Six Thousand Seven Hundred Sixty-Seven

Basics

Value: -1266768 → -1266767 → -1266766

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 35

Digital Root: 8

Palindrome: No

Factorization: 1266767

Divisors: 1, 1266767

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100110101010001001111

Octal: -4652117

Duodecimal: -5110BB

Hexadecimal: -13544f

Square: 1604698632289

Square Root: 1125.5074411126743

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) is the least prime of class n-, according to the Erdős-Selfridge classification of primes. A56637

Class 11- primes. A81430

Positions of records in A064097. A105017

Smallest k such that 3^ⁿ is not congruent to 3^^n-1 mod k, where 3^ⁿ denotes the power tower 3³^...³ (in which 3 appears n times). A246491

Smallest k such that 8^ⁿ is not congruent to 8^^n-1 mod k, where 8^ⁿ denotes the power tower 8⁸^...⁸ (in which 8 appears n times). A246496

Smallest k such that 9^ⁿ is not congruent to 9^^n-1 mod k, where 9^ⁿ denotes the power tower 9⁹^...⁹ (in which 9 appears n times). A246497

Let f(p) = greatest prime divisor of p-1. Sequence gives smallest prime which takes at least n steps to reach 2 when f is iterated. A82449

Smallest k such that 4^ⁿ is not congruent to 4^^n-1 mod k, where 4^ⁿ denotes the power tower 4⁴^...⁴ (in which 4 appears n times). A246492

Smallest k such that 7^ⁿ is not congruent to 7^^n-1 mod k, where 7^ⁿ denotes the power tower 7⁷^...⁷ (in which 7 appears n times). A246495