Properties of the Number -93100

Ninety-Three Thousand One Hundred

Basics

Value: -93101 → -93100 → -93099

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 ² × 7 ² × 19

Divisors: 1, 2, 4, 5, 7, 10, 14, 19, 20, 25

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10110101110101100

Octal: -265654

Duodecimal: -45A64

Hexadecimal: -16bac

Square: 8667610000

Square Root: 305.12292604784716

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)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1)). A233792

Exponential weird numbers: numbers that are exponential abundant (A129575) but not exponential pseudoperfect (A318100). A321146

Mutually-praising pairs excluding autobiographical numbers A138480. Version 2: numbers may have more than 10 digits. A138482

Larger member of primitive friendly pairs ordered by smallest maximal element. A233039

Coreful weird numbers: numbers k that are coreful abundant (A308053) but no subset of their aliquot coreful divisors sums to k. A339939

Number of (n+1)X(2+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11. A233786

Number of (n+1)X(5+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11. A233789