Properties of the Number -43019

Forty-Three Thousand Nineteen

Basics

Value: -43020 → -43019 → -43018

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 43019

Divisors: 1, 43019

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010100000001011

Octal: -124013

Duodecimal: -20A8B

Hexadecimal: -a80b

Square: 1850634361

Square Root: 207.41022154175528

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(0)=0, a(1)=1, a(n) = smallest prime >= a(n-1) + a(n-2). A55498

a(0)=0, a(1)=1, a(n) = smallest prime > a(n-1)+a(n-2). A55499

Apart from initial 0, same as A055498. A73021

Each term is the smallest prime > the sum of the previous 2 terms. A73022

a(n) is the smallest prime used as initial value for Euclid-Mullin (EM) sequence (of variant A000945), such that in the corresponding EM-sequence the p=3 prime arises at the n-th position. A93780

Smallest prime p such that p == 1 (mod prime(n)) and not p == 1 (mod k) for 2 < k < prime(n). A116605

Number of partitions satisfying 0 < cn(2,5) + cn(3,5). A39897

Primes q of the form a³+b², such that p =A130467(n)= a²+b³ is prime and smaller than q; p < q ; b < a. A130468

a(0)=0, a(1)=1; for n>1, a(n) = a(n-1)+a(n-2), except where a(n-1) is a prime greater than 2, in which case a(n) = a(n-1)-a(n-2). A376930