ℕ atory
Play Now

Properties of the Number -255552

Two Hundred Fifty-Five Thousand Five Hundred Fifty-Two

Basics

Value: -255553 → -255552 → -255551

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: Yes

Factorization: 2 6 × 3 × 11 3

Divisors: 1, 2, 3, 4, 6, 8, 11, 12, 16, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -111110011001000000

Octal: -763100

Duodecimal: -103A80

Hexadecimal: -3e640

Square: 65306824704

Square Root: 505.5215128953465

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 T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 9 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=4·floor(n/2), read by rows. A238581
a(n) = lcm(τ(n), pod(n)) where τ(k) = the number of divisors of k (A000005) and pod(n) = the product of divisors of k (A007955). A324528
Palindromes n with the property that for some prime p, n = p + prime(p). A155214
Largest palindromic substring in 2n. A46260
Palindromes with exactly 10 prime factors (counted with multiplicity). A46336
Composite palindromes divisible by the sum of their prime factors (counted with multiplicity). A46348
a(1) = 2, a(n+1) = smallest multiple of a(n) using only prime digits (2,3,5,7). A78232
Palindromes with exactly 10 palindromic prime factors (counted with multiplicity). A46384
a(n) contains n digits (either '2' or '5') and is divisible by 2n. A53317
Number of 0..n arrays of length 5 with each element unequal to at least one neighbor, starting with 0. A221464