Properties of the Number -35667

Thirty-Five Thousand Six Hundred Sixty-Seven

Basics

Value: -35668 → -35667 → -35666

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 1321

Divisors: 1, 3, 9, 27, 1321, 3963, 11889, 35667

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000101101010011

Octal: -105523

Duodecimal: -18783

Hexadecimal: -8b53

Square: 1272134889

Square Root: 188.8570888264457

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 nXk 0..1 arrays with every element equal to 0, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302889

Expansion of 1/((1-x)*(1-x²)²*(1-x³)²*(1-x⁴)²*(1-x⁵)*(1-x⁶)). A45513

a(n) = 49·n² - 2·n. A157362

Odd numbers k such that A173557(k) = A173557(σ(k)), where A173557(n) is multiplicative with a(p^e) = p-1 and σ is the sum of divisors function. A387159

a(n) is the smallest value of m such that prod(m) = n·length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists. A64022

Odd numbers n divisible by 3 such that for all k >= 1 the numbers n·2^k - 1 and n·2^k+1 - 1 do not form a pair of primes. A243858

Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302884