Properties of the Number -151470

One Hundred Fifty-One Thousand Four Hundred Seventy

Basics

Value: -151471 → -151470 → -151469

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ⁴ × 5 × 11 × 17

Divisors: 1, 2, 3, 5, 6, 9, 10, 11, 15, 17

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100100111110101110

Octal: -447656

Duodecimal: -737A6

Hexadecimal: -24fae

Square: 22943160900

Square Root: 389.1914695879138

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 totally isotropic spaces of index n in orthogonal geometry of dimension 2n. A28361

a(n) = ∏_k>=0 (1 + floor(n/2^k)). A132269

Let a,b,c,...k be all divisors of n; a(n) = (a+1)*(b+1)*...*(k+1). A20696

a(n) is the least positive number whose divisors have all possible residues mod n. A280171

a(n) = (1/(n+1)) * ∑_k=0..n (k+1)⁴ * binomial(2·n-k,n-k). A390963

a(n) is smallest number with divisors which are congruent to 1, 2, ..., n-1 mod n. A140539

Obverse convolution (2n+1)**(2ⁿ); see Comments. A374869

Irregular triangular array T; row n shows the coefficients of the (n-1)-st polynomial in the obverse convolution s(x)**t(x), where s(x) = 2ⁿ x and t(x) = x+1. See Comments. A375044

Irregular triangular array T; row n shows the coefficients of the (n-1)-st polynomial in the obverse convolution s(x)**t(x), where s(x) = 2ⁿ and t(x) = 2x+1. See Comments. A375045