Properties of the Number -27146

Twenty-Seven Thousand One Hundred Forty-Six

Basics

Value: -27147 → -27146 → -27145

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 7 ² × 277

Divisors: 1, 2, 7, 14, 49, 98, 277, 554, 1939, 3878

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110101000001010

Octal: -65012

Duodecimal: -13862

Hexadecimal: -6a0a

Square: 736905316

Square Root: 164.7604321431575

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

Array read by antidiagonals of higher order Fubini numbers. A153278

dot_product(n,n-1,...2,1)*(7,8,...,n,1,2,3,4,5,6). A26066

Number of squares (of nonnegative integers) that require n binary (base-2) digits. A126726

Number of triangular numbers T(k) between powers of 2, 2^n-1 < T(k) <= 2ⁿ. A190660

Expansion of ∏_k>=1 1/(1 - x^k)^A007437(k). A301873

Least number·such that xⁿ has n digits equal to k. Case k = 3. A285450

Number of unsensed combinatorial maps with n edges and without faces of degree 1. A380366

a(n) is the ceiling of 2ⁿ * (sqrt(2)-1), i.e., a(n)-1 is the number whose binary representation gives the first n bits of sqrt(2)-1. A136322

Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo 4 and the upper left element equal to 0. A267344

a(n) = floor( ∑_k=0..n-1 n^k / (k! * a(k)) ), for n > 0 with a(0) = 1. A357549