Properties of the Number -3477

Four Hundred Seventy-Seven

Basics

Value: -3478 → -3477 → -3476

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 19 × 61

Divisors: 1, 3, 19, 57, 61, 183, 1159, 3477

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110110010101

Octal: -6625

Duodecimal: -2019

Hexadecimal: -d95

Square: 12089529

Square Root: 58.966091951222275

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

Number of Golomb rulers of length n. A169942

a(n) = (2·n+5)*(2·n+1). A78371

a(1) = 6; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A74342

Numbers k such that k³ divides 14^k² + 1. A177814

a(1)=1; thereafter, a(n) is the smallest number such that both the addition and multiplication tables for (a(1),...,a(n)) contain n*(n+1)/2 different entries (the maximum possible). A337655

Number of integer partitions of n such that (length) * (maximum) >= 2·n. A361906

Number of integer partitions of n such that (length) * (maximum) > 2·n. A361907

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010101. A260475

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 4,4,0,0,1 for x=0,1,2,3,4. A197098

Integers represented in more than one way by a cyclotomic binary form f(x,y) where·and y are prime numbers and 0 < y < x. A299964