ℕ atory
Play Now

Properties of the Number -111113

One Hundred Eleven Thousand One Hundred Thirteen

Basics

Value: -111114 → -111113 → -111112

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 23 × 4831

Divisors: 1, 23, 4831, 111113

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -11011001000001001

Octal: -331011

Duodecimal: -54375

Hexadecimal: -1b209

Square: 12346098769

Square Root: 333.3361666546251

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

Dirichlet convolution of [ 1,1,1,... ] with Ramanujan numbers (A000594). A34777
Numbers with multiplicative digital root value 3. A34050
a(0) = 0; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that the concatenation of any two consecutive digits in the sequence is a prime. A152136
A two-digit Look-and-Say sequence starting with 13: each term summarizes the increasing two-digit substrings of the previous term. A221369
a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that the concatenation of any two consecutive digits in the sequence is a prime. A152607
a(n) = (10n + 17)/9. A98406
a(n) is the least semiprime > a(n-1) whose digits do not appear in a(n-1). A131220
Composite numbers with digital product = 3. A199982
Minimal representation (considered minimal in any canonical base b > 3) of n in a binary system with two distinct digits "1" and "3", not allowing zeros, where a digit d in position p (p = 1,2,3,...,n) represents the value dp. A237454
Consider the partition of the positive odd integers into minimal blocks such that concatenation of numbers in each block is an odious number (A000069). Sequence lists the odious numbers obtained in this way. A248477