Properties of the Number -10000012

Ten Million Twelve

Basics

Value: -10000013 → -10000012 → -10000011

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 11 × 17 × 29 × 461

Divisors: 1, 2, 4, 11, 17, 22, 29, 34, 44, 58

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100110001001011010001100

Octal: -46113214

Duodecimal: -3423064

Hexadecimal: -98968c

Square: 100000240000144

Square Root: 3162.279557534406

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) = smallest number that leads to a new cycle under the Kaprekar map of A151949. A151964

Numbers k such that there are 15 digits in k² and for each factor f of 15 (1,3,5) the sum of digit groupings of size f is a square. A153751

Smallest decimal number containing n palindromic substrings (Version 2). See Comments for precise definition. A361336

Lexicographically earliest strictly increasing decimal autovarious sequence: a(n) = number of distinct n-digit endings (left-zero-padded) of terms in the sequence. A37089

Lexicographically earliest strictly increasing base 7 autovarious sequence: a(n) = number of distinct a(k) mod 7ⁿ (written in base 7). A38116

Lexicographically earliest strictly increasing base 8 autovarious sequence: a(n) = number of distinct a(k) mod 8ⁿ (written in base 8). A38117

Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9ⁿ (written in base 9). A38118