Properties of the Number -103729

One Hundred Three Thousand Seven Hundred Twenty-Nine

Basics

Value: -103730 → -103729 → -103728

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 47 × 2207

Divisors: 1, 47, 2207, 103729

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11001010100110001

Octal: -312461

Duodecimal: -50041

Hexadecimal: -19531

Square: 10759705441

Square Root: 322.06986819632783

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) = Fibonacci(8·n)/21. A49668

Products of distinct terms of A001566: a(n) = ∏_{i=0..floor(log₂(n+1))} L(2ⁱ⁺¹)^bit(n,i). A50614

Products of distinct terms of 1 and rest from A001566: a(n) = ∏_{i=0..floor(log₂(n+1))} L(2ⁱ)^bit(n,i). A50613

Integers that appear as ratios of Fibonacci numbers F(kn)/F(k), but omitting Fibonacci numbers F(n)/F(1) and Lucas numbers F(2n)/F(n). A31122

∑_{i=0..2·A053645(n)} (C(2·A053645(n),i) mod 2)*A000045(n-i) [where C(r,c) is the binomial coefficient (A007318) and A000045(n) is the n-th Fibonacci number]. A75149

a(n) = L(n)*L(2n), where L(n) are the Lucas numbers (A000204). A83564

Numbers of the form Fibonacci(2^c)/Fibonacci(2^b), 1 <= b < c. A181393

Semiprimes of the form n³ - 2·n. A240436

Number of new duplicate terms at a given iteration of the Collatz (or 3x+1) map starting with 0. A275545

Numbers of the form Fibonacci(p^c)/Fibonacci(p^b), where p is some prime and 1<=b<c are two integer exponents. A181420