Properties of the Number -35474

Thirty-Five Thousand Four Hundred Seventy-Four

Basics

Value: -35475 → -35474 → -35473

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 17737

Divisors: 1, 2, 17737, 35474

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000101010010010

Octal: -105222

Duodecimal: -18642

Hexadecimal: -8a92

Square: 1258404676

Square Root: 188.3454273402994

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) is the smallest error in trying to solve n⁵ = x⁵ + y⁵: for each n from 2 on, find positive integers·and y, x <= y < n such that |n⁵ - x⁵ - y⁵| is minimal and let a(n) = n⁵ - x⁵ - y⁵. In case of a tie, choose the solution with smallest y. A369855

T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2 or 3 king-move neighboring 1s. A295985

G.f. E(x) satisfies: E(x) = (1 + x·E(x))*(1 + 2·x*E(x))*(1 + 3·x*E(x))*(1 + 4·x*E(x)). A341968

Total number of parts that are partition numbers A000041 in all partitions of n. A183088

The minimum excess in the prime race of odious primes versus evil primes in the interval (2^n-1,2ⁿ). A127977

Number of n X 3 0..1 arrays with each 1 adjacent to 2 or 3 king-move neighboring 1s. A295980