Properties of the Number -1114129

One Hundred Fourteen Thousand One Hundred Twenty-Nine

Basics

Value: -1114130 → -1114129 → -1114128

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 17 × 65537

Divisors: 1, 17, 65537, 1114129

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -100010000000000010001

Octal: -4200021

Duodecimal: -458901

Hexadecimal: -110011

Square: 1241283428641

Square Root: 1055.5230930680768

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

Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal. A1317

Basis for code in A075928. A75929

One-dimensional cellular automaton 'σ-minus' (Rule 90): 000,001,010,011,100,101,110,111 -> 0,1,0,1,1,0,1,0. A38183

Smallest number m such that the trajectory of m under iteration of Euler's totient function φ(n) [A000010] contains exactly n distinct numbers, including m and the fixed point. A7755

Smallest number whose Euler totient is divisible by 2ⁿ. A53576

Odd values of n for which a regular n-gon can be constructed by compass and straightedge. A45544

Divisors of 2³² - 1 (for a(1) to a(31), the 31 regular polygons with an odd number of sides constructible with ruler and compass). A4729

Numbers k such that φ(k) is a perfect tenth power. A78170

Smallest nonprime number which if used as initial term for iteration of the A000010[x] function, results in list-to-fixed-point of length=n, or 0 if no such number exists. A98196

Semiprimes whose both factors are Fermat primes. A333788